./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-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-69.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 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:51:15,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:51:16,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:51:16,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:51:16,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:51:16,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:51:16,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:51:16,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:51:16,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:51:16,090 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:51:16,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:51:16,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:51:16,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:51:16,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:51:16,095 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:51:16,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:51:16,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:51:16,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:51:16,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:51:16,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:51:16,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:51:16,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:51:16,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:51:16,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:51:16,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:51:16,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:51:16,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:51:16,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:51:16,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:51:16,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:51:16,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:51:16,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:51:16,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:51:16,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:51:16,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:51:16,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:51:16,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:51:16,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:51:16,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:51:16,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:51:16,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:51:16,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:51:16,107 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 -> 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 [2024-10-24 11:51:16,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:51:16,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:51:16,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:51:16,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:51:16,337 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:51:16,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i [2024-10-24 11:51:17,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:51:17,806 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:51:17,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i [2024-10-24 11:51:17,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13878f87b/556656ead54848f29bc10cc4e162ace5/FLAGa3e495c61 [2024-10-24 11:51:18,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13878f87b/556656ead54848f29bc10cc4e162ace5 [2024-10-24 11:51:18,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:51:18,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:51:18,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:51:18,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:51:18,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:51:18,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b0c096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18, skipping insertion in model container [2024-10-24 11:51:18,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:51:18,346 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-69.i[916,929] [2024-10-24 11:51:18,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:51:18,402 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:51:18,411 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-69.i[916,929] [2024-10-24 11:51:18,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:51:18,460 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:51:18,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18 WrapperNode [2024-10-24 11:51:18,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:51:18,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:51:18,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:51:18,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:51:18,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,573 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 469 [2024-10-24 11:51:18,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:51:18,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:51:18,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:51:18,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:51:18,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,627 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:51:18,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:51:18,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:51:18,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:51:18,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:51:18,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (1/1) ... [2024-10-24 11:51:18,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:51:18,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:51:18,699 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-24 11:51:18,709 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-24 11:51:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:51:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:51:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:51:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:51:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:51:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:51:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:51:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:51:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:51:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:51:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:51:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:51:18,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:51:18,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:51:18,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:51:18,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:51:18,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:51:18,854 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:51:18,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:51:19,187 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-24 11:51:19,188 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:51:19,215 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:51:19,215 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:51:19,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:51:19 BoogieIcfgContainer [2024-10-24 11:51:19,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:51:19,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:51:19,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:51:19,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:51:19,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:51:18" (1/3) ... [2024-10-24 11:51:19,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2216c67d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:51:19, skipping insertion in model container [2024-10-24 11:51:19,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:18" (2/3) ... [2024-10-24 11:51:19,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2216c67d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:51:19, skipping insertion in model container [2024-10-24 11:51:19,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:51:19" (3/3) ... [2024-10-24 11:51:19,222 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-69.i [2024-10-24 11:51:19,242 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:51:19,243 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:51:19,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:51:19,319 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@930488e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:51:19,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:51:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:51:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:51:19,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:19,336 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:19,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:19,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:19,341 INFO L85 PathProgramCache]: Analyzing trace with hash 710784747, now seen corresponding path program 1 times [2024-10-24 11:51:19,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:19,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181447682] [2024-10-24 11:51:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:19,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:51:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:51:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:51:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:19,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:19,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181447682] [2024-10-24 11:51:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181447682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:19,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:19,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:51:19,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075207044] [2024-10-24 11:51:19,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:19,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:51:19,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:19,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:51:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:51:19,711 INFO L87 Difference]: Start difference. First operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:51:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:19,760 INFO L93 Difference]: Finished difference Result 171 states and 277 transitions. [2024-10-24 11:51:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:51:19,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-24 11:51:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:19,768 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:51:19,768 INFO L226 Difference]: Without dead ends: 85 [2024-10-24 11:51:19,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-24 11:51:19,774 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:19,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:51:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-24 11:51:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-24 11:51:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:51:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-10-24 11:51:19,808 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 114 [2024-10-24 11:51:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:19,809 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-10-24 11:51:19,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:51:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-10-24 11:51:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:51:19,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:19,812 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:19,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:51:19,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:19,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash 993285713, now seen corresponding path program 1 times [2024-10-24 11:51:19,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:19,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328272304] [2024-10-24 11:51:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:19,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:51:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:51:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:51:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:20,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:20,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328272304] [2024-10-24 11:51:20,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328272304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:20,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:20,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:51:20,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310243918] [2024-10-24 11:51:20,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:20,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:51:20,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:20,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:51:20,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:51:20,140 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:20,190 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2024-10-24 11:51:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:51:20,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-24 11:51:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:20,192 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:51:20,192 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 11:51:20,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-24 11:51:20,194 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:20,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:51:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 11:51:20,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 11:51:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:51:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-10-24 11:51:20,206 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 114 [2024-10-24 11:51:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:20,208 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-10-24 11:51:20,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-10-24 11:51:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:51:20,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:20,212 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:20,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:51:20,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:20,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2031215478, now seen corresponding path program 1 times [2024-10-24 11:51:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679733193] [2024-10-24 11:51:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:20,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:51:20,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744716311] [2024-10-24 11:51:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:20,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:51:20,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:51:20,349 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-24 11:51:20,350 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-24 11:51:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:20,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-24 11:51:20,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:51:20,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-24 11:51:20,710 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-24 11:51:20,715 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-24 11:51:20,720 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-24 11:51:20,724 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-24 11:51:20,728 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-24 11:51:20,732 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-24 11:51:20,736 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-24 11:51:20,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:51:20,821 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 47 treesize of output 37 [2024-10-24 11:51:20,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:51:20,900 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 55 treesize of output 19 [2024-10-24 11:51:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:20,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:51:20,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:20,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679733193] [2024-10-24 11:51:20,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:51:20,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744716311] [2024-10-24 11:51:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744716311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:20,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:20,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:51:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698587746] [2024-10-24 11:51:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:20,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:51:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:20,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:51:20,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:51:20,928 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:21,798 INFO L93 Difference]: Finished difference Result 214 states and 317 transitions. [2024-10-24 11:51:21,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:51:21,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-24 11:51:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:21,800 INFO L225 Difference]: With dead ends: 214 [2024-10-24 11:51:21,800 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 11:51:21,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:51:21,802 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:21,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 469 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:51:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 11:51:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 97. [2024-10-24 11:51:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:51:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-10-24 11:51:21,810 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 116 [2024-10-24 11:51:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:21,810 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-10-24 11:51:21,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-10-24 11:51:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:51:21,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:21,812 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:21,821 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-24 11:51:22,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:51:22,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:22,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:22,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2005586380, now seen corresponding path program 1 times [2024-10-24 11:51:22,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:22,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625200114] [2024-10-24 11:51:22,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:22,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:51:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:51:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:51:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:22,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:22,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625200114] [2024-10-24 11:51:22,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625200114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:22,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:22,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:51:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745167484] [2024-10-24 11:51:22,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:22,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:51:22,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:22,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:51:22,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:51:22,596 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:22,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:22,906 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-10-24 11:51:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:51:22,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-24 11:51:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:22,908 INFO L225 Difference]: With dead ends: 239 [2024-10-24 11:51:22,908 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 11:51:22,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-24 11:51:22,909 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 54 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:22,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 399 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:51:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 11:51:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2024-10-24 11:51:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.425) internal successors, (171), 121 states have internal predecessors, (171), 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-24 11:51:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 205 transitions. [2024-10-24 11:51:22,919 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 205 transitions. Word has length 116 [2024-10-24 11:51:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:22,920 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 205 transitions. [2024-10-24 11:51:22,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 205 transitions. [2024-10-24 11:51:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:51:22,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:22,921 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:22,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:51:22,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:22,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:22,922 INFO L85 PathProgramCache]: Analyzing trace with hash 37070772, now seen corresponding path program 1 times [2024-10-24 11:51:22,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:22,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446987091] [2024-10-24 11:51:22,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:22,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:51:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:51:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:51:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:23,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:23,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446987091] [2024-10-24 11:51:23,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446987091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:23,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:23,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:51:23,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813207115] [2024-10-24 11:51:23,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:23,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:51:23,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:23,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:51:23,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:51:23,531 INFO L87 Difference]: Start difference. First operand 140 states and 205 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:24,112 INFO L93 Difference]: Finished difference Result 386 states and 560 transitions. [2024-10-24 11:51:24,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:51:24,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-24 11:51:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:24,115 INFO L225 Difference]: With dead ends: 386 [2024-10-24 11:51:24,115 INFO L226 Difference]: Without dead ends: 247 [2024-10-24 11:51:24,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:51:24,119 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 134 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:24,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 468 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:51:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-24 11:51:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 152. [2024-10-24 11:51:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 132 states have (on average 1.4393939393939394) internal successors, (190), 133 states have internal predecessors, (190), 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-24 11:51:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2024-10-24 11:51:24,144 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 116 [2024-10-24 11:51:24,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:24,144 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2024-10-24 11:51:24,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2024-10-24 11:51:24,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:51:24,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:24,145 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:24,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:51:24,146 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:24,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash 295236210, now seen corresponding path program 1 times [2024-10-24 11:51:24,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:24,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608129037] [2024-10-24 11:51:24,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:24,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:51:24,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084861700] [2024-10-24 11:51:24,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:24,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:51:24,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:51:24,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:51:24,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:51:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:24,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-24 11:51:24,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:51:24,456 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-24 11:51:24,458 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-24 11:51:24,461 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-24 11:51:24,463 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-24 11:51:24,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:51:24,468 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-24 11:51:24,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:51:24,531 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 47 treesize of output 37 [2024-10-24 11:51:24,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:51:24,592 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 55 treesize of output 19 [2024-10-24 11:51:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:24,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:51:24,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:24,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608129037] [2024-10-24 11:51:24,607 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:51:24,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084861700] [2024-10-24 11:51:24,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084861700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:24,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:24,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:51:24,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881155851] [2024-10-24 11:51:24,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:24,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:51:24,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:24,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:51:24,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:51:24,611 INFO L87 Difference]: Start difference. First operand 152 states and 224 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:25,491 INFO L93 Difference]: Finished difference Result 373 states and 550 transitions. [2024-10-24 11:51:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:51:25,492 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-24 11:51:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:25,493 INFO L225 Difference]: With dead ends: 373 [2024-10-24 11:51:25,493 INFO L226 Difference]: Without dead ends: 222 [2024-10-24 11:51:25,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:51:25,496 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 48 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:25,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 530 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:51:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-24 11:51:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 166. [2024-10-24 11:51:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 147 states have internal predecessors, (211), 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-24 11:51:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 245 transitions. [2024-10-24 11:51:25,515 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 245 transitions. Word has length 116 [2024-10-24 11:51:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:25,515 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 245 transitions. [2024-10-24 11:51:25,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-10-24 11:51:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:51:25,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:25,516 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:25,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:51:25,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 11:51:25,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:25,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:25,723 INFO L85 PathProgramCache]: Analyzing trace with hash -385631054, now seen corresponding path program 1 times [2024-10-24 11:51:25,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:25,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774403604] [2024-10-24 11:51:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:51:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:51:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:51:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:26,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774403604] [2024-10-24 11:51:26,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774403604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:26,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:26,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:51:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674325954] [2024-10-24 11:51:26,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:26,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:51:26,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:26,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:51:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:51:26,052 INFO L87 Difference]: Start difference. First operand 166 states and 245 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:26,330 INFO L93 Difference]: Finished difference Result 376 states and 547 transitions. [2024-10-24 11:51:26,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:51:26,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-24 11:51:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:26,332 INFO L225 Difference]: With dead ends: 376 [2024-10-24 11:51:26,332 INFO L226 Difference]: Without dead ends: 211 [2024-10-24 11:51:26,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-24 11:51:26,333 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 54 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:26,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:51:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-24 11:51:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 114. [2024-10-24 11:51:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:51:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-10-24 11:51:26,340 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 116 [2024-10-24 11:51:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:26,340 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-10-24 11:51:26,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-10-24 11:51:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:51:26,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:26,342 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:26,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:51:26,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:26,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash -407954285, now seen corresponding path program 1 times [2024-10-24 11:51:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991672868] [2024-10-24 11:51:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:51:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:51:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:51:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:26,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:26,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991672868] [2024-10-24 11:51:26,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991672868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:26,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:26,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:51:26,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908198926] [2024-10-24 11:51:26,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:26,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:51:26,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:26,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:51:26,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:51:26,635 INFO L87 Difference]: Start difference. First operand 114 states and 165 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:26,874 INFO L93 Difference]: Finished difference Result 300 states and 433 transitions. [2024-10-24 11:51:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:51:26,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-24 11:51:26,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:26,876 INFO L225 Difference]: With dead ends: 300 [2024-10-24 11:51:26,876 INFO L226 Difference]: Without dead ends: 187 [2024-10-24 11:51:26,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:51:26,877 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 96 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:26,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 726 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:51:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-24 11:51:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 112. [2024-10-24 11:51:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:51:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2024-10-24 11:51:26,884 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 117 [2024-10-24 11:51:26,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:26,885 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2024-10-24 11:51:26,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2024-10-24 11:51:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:51:26,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:26,886 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:26,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:51:26,886 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:26,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:26,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1667874510, now seen corresponding path program 1 times [2024-10-24 11:51:26,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:26,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346728133] [2024-10-24 11:51:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:26,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:51:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:51:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:51:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:51:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:51:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:51:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:51:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:51:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:51:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:51:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:51:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:51:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:51:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:51:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:51:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:27,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:27,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346728133] [2024-10-24 11:51:27,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346728133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:27,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:27,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:51:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462862126] [2024-10-24 11:51:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:27,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:51:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:27,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:51:27,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:51:27,137 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:27,348 INFO L93 Difference]: Finished difference Result 313 states and 449 transitions. [2024-10-24 11:51:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:51:27,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-24 11:51:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:27,350 INFO L225 Difference]: With dead ends: 313 [2024-10-24 11:51:27,350 INFO L226 Difference]: Without dead ends: 202 [2024-10-24 11:51:27,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:51:27,351 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 66 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:27,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 453 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:51:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-24 11:51:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2024-10-24 11:51:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.3976608187134503) internal successors, (239), 172 states have internal predecessors, (239), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:51:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 285 transitions. [2024-10-24 11:51:27,363 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 285 transitions. Word has length 117 [2024-10-24 11:51:27,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:27,364 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 285 transitions. [2024-10-24 11:51:27,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 285 transitions. [2024-10-24 11:51:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:51:27,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:27,365 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:27,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:51:27,365 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:27,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1441215003, now seen corresponding path program 1 times [2024-10-24 11:51:27,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:27,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858215760] [2024-10-24 11:51:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:27,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:51:27,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455108339] [2024-10-24 11:51:27,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:27,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:51:27,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:51:27,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:51:27,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 11:51:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:27,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 11:51:27,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:51:27,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:51:27,752 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 47 treesize of output 37 [2024-10-24 11:51:27,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:51:27,790 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 47 treesize of output 37 [2024-10-24 11:51:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:27,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:51:27,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:51:27,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858215760] [2024-10-24 11:51:27,843 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:51:27,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455108339] [2024-10-24 11:51:27,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455108339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:27,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:27,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:51:27,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970152535] [2024-10-24 11:51:27,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:27,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:51:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:51:27,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:51:27,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:51:27,845 INFO L87 Difference]: Start difference. First operand 199 states and 285 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:29,365 INFO L93 Difference]: Finished difference Result 544 states and 781 transitions. [2024-10-24 11:51:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:51:29,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-24 11:51:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:29,367 INFO L225 Difference]: With dead ends: 544 [2024-10-24 11:51:29,367 INFO L226 Difference]: Without dead ends: 346 [2024-10-24 11:51:29,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:51:29,368 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 52 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:29,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 259 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 11:51:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-24 11:51:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 285. [2024-10-24 11:51:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 257 states have (on average 1.4280155642023347) internal successors, (367), 258 states have internal predecessors, (367), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 11:51:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 413 transitions. [2024-10-24 11:51:29,381 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 413 transitions. Word has length 120 [2024-10-24 11:51:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:29,381 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 413 transitions. [2024-10-24 11:51:29,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 413 transitions. [2024-10-24 11:51:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 11:51:29,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:29,383 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:29,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 11:51:29,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:51:29,584 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:29,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:29,585 INFO L85 PathProgramCache]: Analyzing trace with hash -740150425, now seen corresponding path program 1 times [2024-10-24 11:51:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:51:29,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270791970] [2024-10-24 11:51:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:51:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:51:29,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994903518] [2024-10-24 11:51:29,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:29,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:51:29,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:51:29,674 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:51:29,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 11:51:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:51:29,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:51:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:51:30,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:51:30,209 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:51:30,210 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:51:30,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 11:51:30,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:51:30,418 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:51:30,485 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:51:30,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:51:30 BoogieIcfgContainer [2024-10-24 11:51:30,488 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:51:30,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:51:30,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:51:30,488 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:51:30,489 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:51:19" (3/4) ... [2024-10-24 11:51:30,491 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:51:30,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:51:30,493 INFO L158 Benchmark]: Toolchain (without parser) took 12297.95ms. Allocated memory was 167.8MB in the beginning and 312.5MB in the end (delta: 144.7MB). Free memory was 99.4MB in the beginning and 194.9MB in the end (delta: -95.5MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2024-10-24 11:51:30,493 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:51:30,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.57ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 82.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:51:30,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.39ms. Allocated memory is still 167.8MB. Free memory was 82.0MB in the beginning and 135.8MB in the end (delta: -53.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-10-24 11:51:30,493 INFO L158 Benchmark]: Boogie Preprocessor took 75.32ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 131.6MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:51:30,494 INFO L158 Benchmark]: RCFGBuilder took 566.49ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 96.6MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-24 11:51:30,495 INFO L158 Benchmark]: TraceAbstraction took 11270.46ms. Allocated memory was 167.8MB in the beginning and 312.5MB in the end (delta: 144.7MB). Free memory was 95.9MB in the beginning and 194.9MB in the end (delta: -99.0MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2024-10-24 11:51:30,495 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 312.5MB. Free memory is still 194.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:51:30,496 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.13ms. Allocated memory is still 167.8MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.57ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 82.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.39ms. Allocated memory is still 167.8MB. Free memory was 82.0MB in the beginning and 135.8MB in the end (delta: -53.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.32ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 131.6MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 566.49ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 96.6MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11270.46ms. Allocated memory was 167.8MB in the beginning and 312.5MB in the end (delta: 144.7MB). Free memory was 95.9MB in the beginning and 194.9MB in the end (delta: -99.0MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 312.5MB. Free memory is still 194.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L91] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L95] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ulong() [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_8 = __VERIFIER_nondet_char() [L104] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] RET updateVariables() [L127] CALL step() [L52] EXPR WrapperStruct00.var_1_2 [L52] EXPR WrapperStruct00.var_1_4 [L52] EXPR WrapperStruct00.var_1_5 [L52] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L52] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) [L52] EXPR WrapperStruct00.var_1_3 [L52] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L52] COND TRUE WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3))) [L53] EXPR WrapperStruct00.var_1_8 [L53] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_8 [L65] EXPR WrapperStruct00.var_1_5 [L65] unsigned long int stepLocal_1 = WrapperStruct00.var_1_5; [L66] EXPR WrapperStruct00.var_1_2 [L66] EXPR WrapperStruct00.var_1_3 [L66] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L66] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) [L66] EXPR WrapperStruct00.var_1_3 [L66] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L66] unsigned long int stepLocal_0 = WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))); [L67] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND FALSE !(stepLocal_0 < WrapperStruct00.var_1_5) [L74] EXPR WrapperStruct00.var_1_9 [L74] unsigned char stepLocal_3 = WrapperStruct00.var_1_9; [L75] EXPR WrapperStruct00.var_1_1 [L75] EXPR WrapperStruct00.var_1_7 [L75] signed long int stepLocal_2 = WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7; [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_8 [L76] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L76] COND FALSE !(((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && stepLocal_3) [L87] EXPR WrapperStruct00.var_1_13 [L87] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_13 [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR WrapperStruct00.var_1_2 [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1 [L118] EXPR ((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4))))) [L118] EXPR WrapperStruct00.var_1_2 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR WrapperStruct00.var_1_5 [L118] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))) [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_8 [L118] EXPR (WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))))) && ((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))))) && ((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_8 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR ((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9 [L118] EXPR WrapperStruct00.var_1_9 [L118] EXPR ((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) [L118] EXPR WrapperStruct00.var_1_11 [L118] EXPR WrapperStruct00.var_1_13 [L118] EXPR (((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))))) && ((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118-L119] return ((((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))))) && ((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 553 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 553 mSDsluCounter, 4287 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3152 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3239 IncrementalHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 1135 mSDtfsCounter, 3239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=10, InterpolantAutomatonStates: 63, 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, 10 MinimizatonAttempts, 421 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1152 ConstructedInterpolants, 0 QuantifiedInterpolants, 2826 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1189 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4200/4200 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-24 11:51:30,539 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-69.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 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:51:32,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:51:32,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:51:32,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:51:32,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:51:32,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:51:32,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:51:32,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:51:32,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:51:32,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:51:32,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:51:32,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:51:32,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:51:32,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:51:32,682 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:51:32,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:51:32,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:51:32,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:51:32,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:51:32,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:51:32,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:51:32,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:51:32,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:51:32,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:51:32,687 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:51:32,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:51:32,687 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:51:32,687 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:51:32,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:51:32,687 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:51:32,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:51:32,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:51:32,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:51:32,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:51:32,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:51:32,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:51:32,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:51:32,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:51:32,689 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:51:32,690 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:51:32,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:51:32,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:51:32,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:51:32,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:51:32,692 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:51:32,692 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 -> 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 [2024-10-24 11:51:32,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:51:33,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:51:33,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:51:33,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:51:33,008 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:51:33,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i [2024-10-24 11:51:34,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:51:34,522 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:51:34,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i [2024-10-24 11:51:34,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e5a582a/624d91857d464986a61e9acca076836c/FLAGdbd65e77e [2024-10-24 11:51:34,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e5a582a/624d91857d464986a61e9acca076836c [2024-10-24 11:51:34,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:51:34,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:51:34,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:51:34,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:51:34,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:51:34,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:51:34" (1/1) ... [2024-10-24 11:51:34,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3acff59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:34, skipping insertion in model container [2024-10-24 11:51:34,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:51:34" (1/1) ... [2024-10-24 11:51:34,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:51:35,083 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-69.i[916,929] [2024-10-24 11:51:35,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:51:35,165 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:51:35,175 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-69.i[916,929] [2024-10-24 11:51:35,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:51:35,240 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:51:35,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35 WrapperNode [2024-10-24 11:51:35,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:51:35,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:51:35,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:51:35,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:51:35,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,306 INFO L138 Inliner]: procedures = 36, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 468 [2024-10-24 11:51:35,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:51:35,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:51:35,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:51:35,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:51:35,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,353 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:51:35,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:51:35,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:51:35,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:51:35,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:51:35,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (1/1) ... [2024-10-24 11:51:35,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:51:35,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:51:35,431 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-24 11:51:35,437 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-24 11:51:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:51:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:51:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:51:35,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:51:35,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:51:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:51:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:51:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:51:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:51:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:51:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:51:35,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:51:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:51:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:51:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:51:35,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:51:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:51:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:51:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:51:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:51:35,478 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:51:35,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:51:35,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:51:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:51:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:51:35,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:51:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:51:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:51:35,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:51:35,623 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:51:35,625 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:51:36,159 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-24 11:51:36,160 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:51:36,192 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:51:36,192 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:51:36,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:51:36 BoogieIcfgContainer [2024-10-24 11:51:36,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:51:36,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:51:36,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:51:36,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:51:36,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:51:34" (1/3) ... [2024-10-24 11:51:36,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61615821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:51:36, skipping insertion in model container [2024-10-24 11:51:36,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:51:35" (2/3) ... [2024-10-24 11:51:36,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61615821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:51:36, skipping insertion in model container [2024-10-24 11:51:36,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:51:36" (3/3) ... [2024-10-24 11:51:36,200 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-69.i [2024-10-24 11:51:36,212 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:51:36,213 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:51:36,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:51:36,263 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;@b460d85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:51:36,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:51:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:51:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:51:36,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:36,277 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:36,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:36,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash 710784747, now seen corresponding path program 1 times [2024-10-24 11:51:36,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:51:36,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098717863] [2024-10-24 11:51:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:36,293 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-24 11:51:36,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:51:36,296 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-24 11:51:36,297 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-24 11:51:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:36,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:51:36,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:51:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-24 11:51:36,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:51:36,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:51:36,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098717863] [2024-10-24 11:51:36,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098717863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:36,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:36,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:51:36,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718053650] [2024-10-24 11:51:36,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:36,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:51:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:51:36,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:51:36,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:51:36,677 INFO L87 Difference]: Start difference. First operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:51:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:36,718 INFO L93 Difference]: Finished difference Result 171 states and 277 transitions. [2024-10-24 11:51:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:51:36,722 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-24 11:51:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:36,729 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:51:36,730 INFO L226 Difference]: Without dead ends: 85 [2024-10-24 11:51:36,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-24 11:51:36,737 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:36,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:51:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-24 11:51:36,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-24 11:51:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:51:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-10-24 11:51:36,783 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 114 [2024-10-24 11:51:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:36,784 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-10-24 11:51:36,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:51:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-10-24 11:51:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:51:36,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:36,789 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:36,798 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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:51:36,990 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-24 11:51:36,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:36,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash 993285713, now seen corresponding path program 1 times [2024-10-24 11:51:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:51:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655986485] [2024-10-24 11:51:36,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:36,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-24 11:51:36,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:51:36,996 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-24 11:51:36,997 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-24 11:51:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:37,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:51:37,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:51:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:37,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:51:37,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:51:37,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655986485] [2024-10-24 11:51:37,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655986485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:37,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:37,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:51:37,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689328325] [2024-10-24 11:51:37,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:37,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:51:37,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:51:37,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:51:37,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:51:37,207 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:51:37,246 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2024-10-24 11:51:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:51:37,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-24 11:51:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:51:37,248 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:51:37,248 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 11:51:37,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 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-24 11:51:37,250 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:51:37,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:51:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 11:51:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 11:51:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:51:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-10-24 11:51:37,258 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 114 [2024-10-24 11:51:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:51:37,259 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-10-24 11:51:37,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-10-24 11:51:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:51:37,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:51:37,262 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:51:37,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:51:37,462 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-24 11:51:37,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:51:37,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:51:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2031215478, now seen corresponding path program 1 times [2024-10-24 11:51:37,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:51:37,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904457283] [2024-10-24 11:51:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:51:37,465 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-24 11:51:37,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:51:37,470 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-24 11:51:37,471 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-24 11:51:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:51:37,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 11:51:37,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:51:37,846 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-24 11:51:38,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:51:38,120 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 50 treesize of output 44 [2024-10-24 11:51:41,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:51:41,513 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 62 treesize of output 20 [2024-10-24 11:51:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:51:41,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:51:41,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:51:41,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904457283] [2024-10-24 11:51:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904457283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:51:41,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:51:41,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:51:41,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521117945] [2024-10-24 11:51:41,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:51:41,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:51:41,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:51:41,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:51:41,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=65, Unknown=1, NotChecked=0, Total=90 [2024-10-24 11:51:41,732 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:51:46,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:51:50,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:51:54,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:51:57,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:52:01,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:06,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:52:10,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:14,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:52:18,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:22,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:52:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:24,117 INFO L93 Difference]: Finished difference Result 214 states and 317 transitions. [2024-10-24 11:52:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:52:24,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-24 11:52:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:24,121 INFO L225 Difference]: With dead ends: 214 [2024-10-24 11:52:24,121 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 11:52:24,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=31, Invalid=78, Unknown=1, NotChecked=0, Total=110 [2024-10-24 11:52:24,122 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 92 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:24,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 469 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 471 Invalid, 10 Unknown, 0 Unchecked, 42.2s Time] [2024-10-24 11:52:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 11:52:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2024-10-24 11:52:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:52:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2024-10-24 11:52:24,131 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 116 [2024-10-24 11:52:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:24,132 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2024-10-24 11:52:24,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:52:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2024-10-24 11:52:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:52:24,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:24,134 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:52:24,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:52:24,337 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-24 11:52:24,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:24,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2005586380, now seen corresponding path program 1 times [2024-10-24 11:52:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:24,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118886687] [2024-10-24 11:52:24,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:24,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:24,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:24,343 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-24 11:52:24,344 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-24 11:52:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:24,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:52:24,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:24,590 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-24 11:52:24,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:52:24,643 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 46 treesize of output 22 [2024-10-24 11:52:24,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:52:24,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-10-24 11:52:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:52:24,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:24,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:24,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118886687] [2024-10-24 11:52:24,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118886687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:24,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:24,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:52:24,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859986202] [2024-10-24 11:52:24,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:24,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:52:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:24,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:52:24,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:52:24,686 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:52:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:25,258 INFO L93 Difference]: Finished difference Result 235 states and 344 transitions. [2024-10-24 11:52:25,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:52:25,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-24 11:52:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:25,262 INFO L225 Difference]: With dead ends: 235 [2024-10-24 11:52:25,262 INFO L226 Difference]: Without dead ends: 141 [2024-10-24 11:52:25,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:25,263 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 54 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:25,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 337 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:52:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-24 11:52:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-10-24 11:52:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.4152542372881356) internal successors, (167), 119 states have internal predecessors, (167), 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-24 11:52:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2024-10-24 11:52:25,273 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 116 [2024-10-24 11:52:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:25,273 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2024-10-24 11:52:25,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:52:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2024-10-24 11:52:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:52:25,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:25,275 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:52:25,286 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-24 11:52:25,475 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-24 11:52:25,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:25,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash 37070772, now seen corresponding path program 1 times [2024-10-24 11:52:25,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:25,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291425907] [2024-10-24 11:52:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:25,477 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-24 11:52:25,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:25,484 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-24 11:52:25,492 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-24 11:52:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:25,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:52:25,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:25,759 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-24 11:52:25,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:52:25,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2024-10-24 11:52:27,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:52:27,831 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 55 treesize of output 19 [2024-10-24 11:52:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:52:27,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:27,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:27,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291425907] [2024-10-24 11:52:27,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291425907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:27,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:27,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:52:27,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408999551] [2024-10-24 11:52:27,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:27,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:27,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:27,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=19, Unknown=1, NotChecked=0, Total=30 [2024-10-24 11:52:27,850 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:52:31,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:52:35,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:52:39,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:52:42,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:52:46,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:52:50,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:52:54,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]