./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_codestructure_dependencies_file-9.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_codestructure_dependencies_file-9.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 c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:13:58,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:13:58,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:13:58,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:13:58,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:13:58,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:13:58,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:13:58,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:13:58,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:13:58,889 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:13:58,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:13:58,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:13:58,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:13:58,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:13:58,892 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:13:58,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:13:58,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:13:58,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:13:58,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:13:58,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:13:58,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:13:58,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:13:58,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:13:58,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:13:58,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:13:58,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:13:58,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:13:58,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:13:58,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:13:58,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:13:58,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:13:58,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:13:58,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:13:58,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:13:58,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:13:58,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:13:58,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:13:58,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:13:58,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:13:58,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:13:58,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:13:58,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:13:58,900 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 -> c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 [2024-10-24 05:13:59,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:13:59,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:13:59,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:13:59,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:13:59,141 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:13:59,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2024-10-24 05:14:00,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:14:00,523 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:14:00,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2024-10-24 05:14:00,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fbe55dea/4e5e2740011b49b4ab8f91a0c1e5a1b9/FLAGe43294cc6 [2024-10-24 05:14:00,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fbe55dea/4e5e2740011b49b4ab8f91a0c1e5a1b9 [2024-10-24 05:14:00,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:14:00,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:14:00,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:14:00,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:14:00,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:14:00,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:14:00" (1/1) ... [2024-10-24 05:14:00,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725e636f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:00, skipping insertion in model container [2024-10-24 05:14:00,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:14:00" (1/1) ... [2024-10-24 05:14:00,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:14:01,103 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_codestructure_dependencies_file-9.i[918,931] [2024-10-24 05:14:01,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:14:01,169 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:14:01,178 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_codestructure_dependencies_file-9.i[918,931] [2024-10-24 05:14:01,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:14:01,224 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:14:01,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01 WrapperNode [2024-10-24 05:14:01,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:14:01,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:14:01,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:14:01,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:14:01,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,274 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-10-24 05:14:01,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:14:01,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:14:01,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:14:01,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:14:01,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,311 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:14:01,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:14:01,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:14:01,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:14:01,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:14:01,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (1/1) ... [2024-10-24 05:14:01,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:14:01,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:14:01,362 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 05:14:01,365 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 05:14:01,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:14:01,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:14:01,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:14:01,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:14:01,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:14:01,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:14:01,461 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:14:01,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:14:01,780 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 05:14:01,780 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:14:01,821 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:14:01,822 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:14:01,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:14:01 BoogieIcfgContainer [2024-10-24 05:14:01,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:14:01,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:14:01,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:14:01,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:14:01,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:14:00" (1/3) ... [2024-10-24 05:14:01,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b6912a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:14:01, skipping insertion in model container [2024-10-24 05:14:01,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:01" (2/3) ... [2024-10-24 05:14:01,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b6912a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:14:01, skipping insertion in model container [2024-10-24 05:14:01,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:14:01" (3/3) ... [2024-10-24 05:14:01,845 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-9.i [2024-10-24 05:14:01,861 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:14:01,861 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:14:01,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:14:01,922 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;@714e51af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:14:01,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:14:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 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 05:14:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 05:14:01,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:01,936 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] [2024-10-24 05:14:01,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:01,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:01,943 INFO L85 PathProgramCache]: Analyzing trace with hash 234769514, now seen corresponding path program 1 times [2024-10-24 05:14:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:01,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537518634] [2024-10-24 05:14:01,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:14:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:14:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:14:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:14:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:14:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:14:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:14:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:14:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,289 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 05:14:02,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537518634] [2024-10-24 05:14:02,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537518634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:02,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:02,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:14:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236675973] [2024-10-24 05:14:02,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:02,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:14:02,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:02,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:14:02,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:14:02,333 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 05:14:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:02,376 INFO L93 Difference]: Finished difference Result 127 states and 213 transitions. [2024-10-24 05:14:02,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:14:02,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 101 [2024-10-24 05:14:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:02,390 INFO L225 Difference]: With dead ends: 127 [2024-10-24 05:14:02,390 INFO L226 Difference]: Without dead ends: 63 [2024-10-24 05:14:02,395 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 05:14:02,400 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:02,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:14:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-24 05:14:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-24 05:14:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 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 05:14:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-10-24 05:14:02,455 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 101 [2024-10-24 05:14:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:02,456 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-10-24 05:14:02,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 05:14:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-10-24 05:14:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 05:14:02,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:02,461 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] [2024-10-24 05:14:02,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:14:02,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:02,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:02,462 INFO L85 PathProgramCache]: Analyzing trace with hash 190029092, now seen corresponding path program 1 times [2024-10-24 05:14:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:02,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717932747] [2024-10-24 05:14:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:14:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:14:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:14:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:14:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:14:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:14:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:14:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:14:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:02,681 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 05:14:02,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:02,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717932747] [2024-10-24 05:14:02,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717932747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:02,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:02,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:14:02,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625303498] [2024-10-24 05:14:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:02,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:14:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:14:02,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:14:02,686 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 05:14:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:02,714 INFO L93 Difference]: Finished difference Result 126 states and 191 transitions. [2024-10-24 05:14:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:14:02,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 101 [2024-10-24 05:14:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:02,717 INFO L225 Difference]: With dead ends: 126 [2024-10-24 05:14:02,717 INFO L226 Difference]: Without dead ends: 64 [2024-10-24 05:14:02,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:14:02,719 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:02,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:14:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-24 05:14:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-24 05:14:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 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 05:14:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2024-10-24 05:14:02,734 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 101 [2024-10-24 05:14:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:02,736 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2024-10-24 05:14:02,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 05:14:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2024-10-24 05:14:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 05:14:02,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:02,741 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] [2024-10-24 05:14:02,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:14:02,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:02,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash -766399701, now seen corresponding path program 1 times [2024-10-24 05:14:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:02,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730540911] [2024-10-24 05:14:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:14:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:14:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:14:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:14:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:14:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:14:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:14:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:14:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:05,440 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 05:14:05,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:05,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730540911] [2024-10-24 05:14:05,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730540911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:05,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 05:14:05,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862192466] [2024-10-24 05:14:05,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:05,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 05:14:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:05,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 05:14:05,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 05:14:05,446 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 05:14:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:06,959 INFO L93 Difference]: Finished difference Result 196 states and 290 transitions. [2024-10-24 05:14:06,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 05:14:06,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2024-10-24 05:14:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:06,964 INFO L225 Difference]: With dead ends: 196 [2024-10-24 05:14:06,964 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 05:14:06,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2024-10-24 05:14:06,970 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 399 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:06,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 245 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 05:14:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 05:14:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 91. [2024-10-24 05:14:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 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 05:14:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2024-10-24 05:14:06,990 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 102 [2024-10-24 05:14:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2024-10-24 05:14:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 05:14:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2024-10-24 05:14:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 05:14:06,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:06,992 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] [2024-10-24 05:14:06,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:14:06,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:06,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash -508234263, now seen corresponding path program 1 times [2024-10-24 05:14:06,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752929773] [2024-10-24 05:14:06,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:14:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:14:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:14:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:14:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:14:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:14:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:14:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:14:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:08,149 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 05:14:08,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752929773] [2024-10-24 05:14:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752929773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:08,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 05:14:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165779662] [2024-10-24 05:14:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:08,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 05:14:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:08,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 05:14:08,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:14:08,151 INFO L87 Difference]: Start difference. First operand 91 states and 136 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 05:14:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:08,453 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2024-10-24 05:14:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:14:08,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 102 [2024-10-24 05:14:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:08,456 INFO L225 Difference]: With dead ends: 240 [2024-10-24 05:14:08,456 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 05:14:08,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:14:08,457 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 90 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:08,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 315 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:14:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 05:14:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 97. [2024-10-24 05:14:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 79 states have internal predecessors, (115), 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 05:14:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2024-10-24 05:14:08,470 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 102 [2024-10-24 05:14:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:08,471 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2024-10-24 05:14:08,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 05:14:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2024-10-24 05:14:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 05:14:08,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:08,477 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] [2024-10-24 05:14:08,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:14:08,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:08,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:08,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1529302617, now seen corresponding path program 1 times [2024-10-24 05:14:08,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:08,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014999496] [2024-10-24 05:14:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:08,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:14:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:14:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:14:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:14:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:14:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:14:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:14:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:14:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:10,190 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 05:14:10,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:10,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014999496] [2024-10-24 05:14:10,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014999496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:10,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:10,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 05:14:10,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696577147] [2024-10-24 05:14:10,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:10,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 05:14:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:10,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 05:14:10,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:14:10,193 INFO L87 Difference]: Start difference. First operand 97 states and 145 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 05:14:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:10,589 INFO L93 Difference]: Finished difference Result 245 states and 368 transitions. [2024-10-24 05:14:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:14:10,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 102 [2024-10-24 05:14:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:10,591 INFO L225 Difference]: With dead ends: 245 [2024-10-24 05:14:10,591 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 05:14:10,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:14:10,592 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 82 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:10,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 213 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:14:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 05:14:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 91. [2024-10-24 05:14:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 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 05:14:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2024-10-24 05:14:10,607 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 102 [2024-10-24 05:14:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:10,607 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2024-10-24 05:14:10,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 05:14:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2024-10-24 05:14:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 05:14:10,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:10,608 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] [2024-10-24 05:14:10,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:14:10,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:10,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:10,609 INFO L85 PathProgramCache]: Analyzing trace with hash 919151339, now seen corresponding path program 1 times [2024-10-24 05:14:10,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:10,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924272107] [2024-10-24 05:14:10,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:10,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:14:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:14:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:14:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:14:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:14:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:14:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:14:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:14:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,139 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 05:14:11,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:11,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924272107] [2024-10-24 05:14:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924272107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:11,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 05:14:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140657721] [2024-10-24 05:14:11,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:11,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 05:14:11,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:11,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 05:14:11,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:14:11,141 INFO L87 Difference]: Start difference. First operand 91 states and 136 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 05:14:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:11,435 INFO L93 Difference]: Finished difference Result 219 states and 326 transitions. [2024-10-24 05:14:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:14:11,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 102 [2024-10-24 05:14:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:11,437 INFO L225 Difference]: With dead ends: 219 [2024-10-24 05:14:11,437 INFO L226 Difference]: Without dead ends: 129 [2024-10-24 05:14:11,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:14:11,438 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 81 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:11,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 347 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:14:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-24 05:14:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 70. [2024-10-24 05:14:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 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 05:14:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2024-10-24 05:14:11,446 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 102 [2024-10-24 05:14:11,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:11,446 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 101 transitions. [2024-10-24 05:14:11,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 05:14:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2024-10-24 05:14:11,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 05:14:11,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:11,447 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] [2024-10-24 05:14:11,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 05:14:11,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:11,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2019549872, now seen corresponding path program 1 times [2024-10-24 05:14:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:11,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597530200] [2024-10-24 05:14:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:11,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:14:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:14:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:14:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:14:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:14:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:14:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:14:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:14:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 05:14:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597530200] [2024-10-24 05:14:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597530200] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:14:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187548624] [2024-10-24 05:14:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:11,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:14:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:14:11,623 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 05:14:11,625 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 05:14:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:11,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 05:14:11,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:14:11,804 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 05:14:11,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:14:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187548624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:11,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 05:14:11,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-10-24 05:14:11,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099887416] [2024-10-24 05:14:11,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:11,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:14:11,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:14:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:14:11,807 INFO L87 Difference]: Start difference. First operand 70 states and 101 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 05:14:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:11,928 INFO L93 Difference]: Finished difference Result 168 states and 238 transitions. [2024-10-24 05:14:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:14:11,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 104 [2024-10-24 05:14:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:11,930 INFO L225 Difference]: With dead ends: 168 [2024-10-24 05:14:11,930 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 05:14:11,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 05:14:11,931 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 30 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:11,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 283 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:14:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 05:14:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-10-24 05:14:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 76 states have internal predecessors, (101), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 05:14:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-10-24 05:14:11,939 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 104 [2024-10-24 05:14:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:11,939 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-10-24 05:14:11,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 05:14:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-10-24 05:14:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 05:14:11,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:11,940 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] [2024-10-24 05:14:11,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 05:14:12,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:14:12,141 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:12,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:12,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1871268176, now seen corresponding path program 1 times [2024-10-24 05:14:12,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408654663] [2024-10-24 05:14:12,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:12,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:14:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:14:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:14:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:14:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:14:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:14:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:14:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:14:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 63 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-10-24 05:14:12,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:12,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408654663] [2024-10-24 05:14:12,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408654663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:14:12,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485070392] [2024-10-24 05:14:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:12,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:14:12,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:14:12,384 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 05:14:12,385 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 05:14:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:12,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 05:14:12,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:14:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-24 05:14:12,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:14:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 05:14:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485070392] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:14:12,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 05:14:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-24 05:14:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583482326] [2024-10-24 05:14:12,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 05:14:12,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 05:14:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 05:14:12,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-24 05:14:12,803 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-10-24 05:14:12,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:12,998 INFO L93 Difference]: Finished difference Result 205 states and 280 transitions. [2024-10-24 05:14:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 05:14:12,999 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 104 [2024-10-24 05:14:12,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:13,001 INFO L225 Difference]: With dead ends: 205 [2024-10-24 05:14:13,002 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 05:14:13,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-10-24 05:14:13,003 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 142 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:13,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 154 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:14:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 05:14:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2024-10-24 05:14:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 85 states have internal predecessors, (109), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 05:14:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 143 transitions. [2024-10-24 05:14:13,014 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 143 transitions. Word has length 104 [2024-10-24 05:14:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:13,015 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 143 transitions. [2024-10-24 05:14:13,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-10-24 05:14:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 143 transitions. [2024-10-24 05:14:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 05:14:13,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:13,016 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] [2024-10-24 05:14:13,030 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 05:14:13,216 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,SelfDestructingSolverStorable7 [2024-10-24 05:14:13,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:13,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash 860150926, now seen corresponding path program 1 times [2024-10-24 05:14:13,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445925544] [2024-10-24 05:14:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:13,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:14:13,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [78398848] [2024-10-24 05:14:13,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:13,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:14:13,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:14:13,254 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 05:14:13,255 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 05:14:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:13,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 05:14:13,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:14:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-24 05:14:13,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:14:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 05:14:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445925544] [2024-10-24 05:14:13,807 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 05:14:13,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78398848] [2024-10-24 05:14:13,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78398848] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:14:13,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:14:13,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 05:14:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279535991] [2024-10-24 05:14:13,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:14:13,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 05:14:13,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:13,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 05:14:13,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-24 05:14:13,809 INFO L87 Difference]: Start difference. First operand 108 states and 143 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-24 05:14:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:14,417 INFO L93 Difference]: Finished difference Result 327 states and 425 transitions. [2024-10-24 05:14:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 05:14:14,419 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 104 [2024-10-24 05:14:14,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:14,421 INFO L225 Difference]: With dead ends: 327 [2024-10-24 05:14:14,421 INFO L226 Difference]: Without dead ends: 220 [2024-10-24 05:14:14,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2024-10-24 05:14:14,422 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 190 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:14,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 504 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 05:14:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-24 05:14:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 120. [2024-10-24 05:14:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 05:14:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 165 transitions. [2024-10-24 05:14:14,438 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 165 transitions. Word has length 104 [2024-10-24 05:14:14,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:14,439 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 165 transitions. [2024-10-24 05:14:14,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-24 05:14:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2024-10-24 05:14:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 05:14:14,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:14,440 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] [2024-10-24 05:14:14,455 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 05:14:14,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:14:14,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:14,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash 882134053, now seen corresponding path program 1 times [2024-10-24 05:14:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:14,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625466029] [2024-10-24 05:14:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:14,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:14:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:14:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:14:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:14:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:14:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:14:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:14:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:14:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:14,693 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 05:14:14,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:14,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625466029] [2024-10-24 05:14:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625466029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:14,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:14,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:14:14,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972377944] [2024-10-24 05:14:14,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:14,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:14:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:14:14,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:14:14,696 INFO L87 Difference]: Start difference. First operand 120 states and 165 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 05:14:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:14,736 INFO L93 Difference]: Finished difference Result 291 states and 393 transitions. [2024-10-24 05:14:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:14:14,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 104 [2024-10-24 05:14:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:14,738 INFO L225 Difference]: With dead ends: 291 [2024-10-24 05:14:14,738 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 05:14:14,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:14:14,738 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 77 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:14,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 178 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:14:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 05:14:14,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 120. [2024-10-24 05:14:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 05:14:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2024-10-24 05:14:14,748 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 104 [2024-10-24 05:14:14,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:14,749 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2024-10-24 05:14:14,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 05:14:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2024-10-24 05:14:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 05:14:14,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:14,750 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] [2024-10-24 05:14:14,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 05:14:14,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:14,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash 234935175, now seen corresponding path program 1 times [2024-10-24 05:14:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:14,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370082109] [2024-10-24 05:14:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:14,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:14:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:14:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:14:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:14:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:14:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:14:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:14:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:14:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:14:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:14:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:14:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:14:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:14:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:14:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:14:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:16,146 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 05:14:16,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:14:16,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370082109] [2024-10-24 05:14:16,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370082109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:16,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:16,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 05:14:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562459265] [2024-10-24 05:14:16,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:16,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 05:14:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:14:16,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 05:14:16,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 05:14:16,148 INFO L87 Difference]: Start difference. First operand 120 states and 164 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 05:14:17,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:17,120 INFO L93 Difference]: Finished difference Result 297 states and 402 transitions. [2024-10-24 05:14:17,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 05:14:17,124 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 105 [2024-10-24 05:14:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:17,125 INFO L225 Difference]: With dead ends: 297 [2024-10-24 05:14:17,125 INFO L226 Difference]: Without dead ends: 178 [2024-10-24 05:14:17,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-24 05:14:17,125 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 279 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:17,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 314 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 05:14:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-24 05:14:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 147. [2024-10-24 05:14:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 126 states have (on average 1.3492063492063493) internal successors, (170), 126 states have internal predecessors, (170), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 05:14:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 200 transitions. [2024-10-24 05:14:17,138 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 200 transitions. Word has length 105 [2024-10-24 05:14:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:17,142 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 200 transitions. [2024-10-24 05:14:17,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 05:14:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 200 transitions. [2024-10-24 05:14:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 05:14:17,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:17,143 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] [2024-10-24 05:14:17,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 05:14:17,144 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:17,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1629822972, now seen corresponding path program 1 times [2024-10-24 05:14:17,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:14:17,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199833320] [2024-10-24 05:14:17,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:17,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:14:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:14:17,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978412332] [2024-10-24 05:14:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:17,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:14:17,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:14:17,185 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 05:14:17,186 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 05:14:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:14:17,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:14:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:14:17,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:14:17,539 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:14:17,539 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:14:17,549 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 05:14:17,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:14:17,745 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:14:17,803 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:14:17,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:14:17 BoogieIcfgContainer [2024-10-24 05:14:17,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:14:17,808 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:14:17,808 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:14:17,808 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:14:17,809 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:14:01" (3/4) ... [2024-10-24 05:14:17,810 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:14:17,811 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:14:17,812 INFO L158 Benchmark]: Toolchain (without parser) took 16879.84ms. Allocated memory was 144.7MB in the beginning and 415.2MB in the end (delta: 270.5MB). Free memory was 90.5MB in the beginning and 320.0MB in the end (delta: -229.5MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2024-10-24 05:14:17,812 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 144.7MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:14:17,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.68ms. Allocated memory is still 144.7MB. Free memory was 90.1MB in the beginning and 75.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 05:14:17,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.60ms. Allocated memory is still 144.7MB. Free memory was 75.4MB in the beginning and 72.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 05:14:17,813 INFO L158 Benchmark]: Boogie Preprocessor took 56.00ms. Allocated memory is still 144.7MB. Free memory was 72.6MB in the beginning and 69.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:14:17,813 INFO L158 Benchmark]: RCFGBuilder took 489.83ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 69.2MB in the beginning and 160.3MB in the end (delta: -91.1MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-24 05:14:17,814 INFO L158 Benchmark]: TraceAbstraction took 15969.32ms. Allocated memory was 192.9MB in the beginning and 415.2MB in the end (delta: 222.3MB). Free memory was 159.3MB in the beginning and 321.1MB in the end (delta: -161.7MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2024-10-24 05:14:17,814 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 415.2MB. Free memory was 321.1MB in the beginning and 320.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 05:14:17,815 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.09ms. Allocated memory is still 144.7MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.68ms. Allocated memory is still 144.7MB. Free memory was 90.1MB in the beginning and 75.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.60ms. Allocated memory is still 144.7MB. Free memory was 75.4MB in the beginning and 72.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.00ms. Allocated memory is still 144.7MB. Free memory was 72.6MB in the beginning and 69.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 489.83ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 69.2MB in the beginning and 160.3MB in the end (delta: -91.1MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15969.32ms. Allocated memory was 192.9MB in the beginning and 415.2MB in the end (delta: 222.3MB). Free memory was 159.3MB in the beginning and 321.1MB in the end (delta: -161.7MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 415.2MB. Free memory was 321.1MB in the beginning and 320.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 114, overapproximation of shiftLeft at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L109] last_1_var_1_10 = var_1_10 [L110] last_1_var_1_12 = var_1_12 [L111] last_1_var_1_13 = var_1_13 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L84] var_1_3 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L85] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L87] var_1_5 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L88] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] var_1_6 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] var_1_7 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L96] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L96] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L97] var_1_8 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6, var_1_9=9/5] [L98] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6, var_1_9=9/5] [L99] var_1_9 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L100] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L101] var_1_11 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L103] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L103] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L104] var_1_15 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L105] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L106] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L106] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L122] RET updateVariables() [L123] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L45] COND TRUE var_1_6 <= (last_1_var_1_12 + var_1_7) [L46] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L50] var_1_18 = var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L60] COND FALSE !((- var_1_9) <= var_1_8) [L73] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L75] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L75] COND FALSE !((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L114] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L114] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L114] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L114] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L114-L115] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 12, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1376 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1370 mSDsluCounter, 2822 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1914 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2313 IncrementalHoareTripleChecker+Invalid, 2390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 908 mSDtfsCounter, 2313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 936 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=11, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 400 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1653 NumberOfCodeBlocks, 1653 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1532 ConstructedInterpolants, 0 QuantifiedInterpolants, 6707 SizeOfPredicates, 10 NumberOfNonLiveVariables, 764 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 6051/6300 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 05:14:17,867 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_codestructure_dependencies_file-9.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 c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:14:19,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:14:19,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:14:19,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:14:19,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:14:19,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:14:19,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:14:19,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:14:19,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:14:19,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:14:19,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:14:19,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:14:19,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:14:19,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:14:19,914 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:14:19,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:14:19,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:14:19,915 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:14:19,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:14:19,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:14:19,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:14:19,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:14:19,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:14:19,918 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:14:19,918 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:14:19,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:14:19,919 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:14:19,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:14:19,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:14:19,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:14:19,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:14:19,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:14:19,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:14:19,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:14:19,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:14:19,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:14:19,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:14:19,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:14:19,921 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:14:19,921 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:14:19,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:14:19,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:14:19,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:14:19,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:14:19,925 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:14:19,925 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 -> c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 [2024-10-24 05:14:20,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:14:20,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:14:20,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:14:20,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:14:20,226 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:14:20,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2024-10-24 05:14:21,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:14:21,767 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:14:21,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2024-10-24 05:14:21,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/123370336/136758a98568452c96d300b3b342a8fd/FLAG6a5b79f8f [2024-10-24 05:14:22,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/123370336/136758a98568452c96d300b3b342a8fd [2024-10-24 05:14:22,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:14:22,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:14:22,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:14:22,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:14:22,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:14:22,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ffc5dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22, skipping insertion in model container [2024-10-24 05:14:22,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:14:22,338 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_codestructure_dependencies_file-9.i[918,931] [2024-10-24 05:14:22,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:14:22,402 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:14:22,414 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_codestructure_dependencies_file-9.i[918,931] [2024-10-24 05:14:22,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:14:22,464 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:14:22,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22 WrapperNode [2024-10-24 05:14:22,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:14:22,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:14:22,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:14:22,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:14:22,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,505 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-24 05:14:22,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:14:22,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:14:22,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:14:22,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:14:22,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:14:22,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:14:22,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:14:22,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:14:22,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:14:22,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (1/1) ... [2024-10-24 05:14:22,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:14:22,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:14:22,608 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 05:14:22,613 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 05:14:22,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:14:22,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:14:22,647 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:14:22,647 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:14:22,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:14:22,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:14:22,728 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:14:22,730 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:14:23,036 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:14:23,036 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:14:23,087 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:14:23,088 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:14:23,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:14:23 BoogieIcfgContainer [2024-10-24 05:14:23,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:14:23,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:14:23,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:14:23,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:14:23,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:14:22" (1/3) ... [2024-10-24 05:14:23,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f2bda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:14:23, skipping insertion in model container [2024-10-24 05:14:23,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:14:22" (2/3) ... [2024-10-24 05:14:23,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f2bda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:14:23, skipping insertion in model container [2024-10-24 05:14:23,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:14:23" (3/3) ... [2024-10-24 05:14:23,098 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-9.i [2024-10-24 05:14:23,119 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:14:23,119 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:14:23,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:14:23,184 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;@4c508534, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:14:23,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:14:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 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 05:14:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 05:14:23,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:23,200 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] [2024-10-24 05:14:23,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:23,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:23,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1070841392, now seen corresponding path program 1 times [2024-10-24 05:14:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:14:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777100447] [2024-10-24 05:14:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:23,220 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 05:14:23,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:14:23,223 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 05:14:23,223 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 05:14:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:23,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:14:23,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:14:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-24 05:14:23,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:14:23,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:14:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777100447] [2024-10-24 05:14:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777100447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:14:23,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:14:23,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:14:23,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616360525] [2024-10-24 05:14:23,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:14:23,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:14:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:14:23,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:14:23,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:14:23,454 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 05:14:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:14:23,540 INFO L93 Difference]: Finished difference Result 91 states and 161 transitions. [2024-10-24 05:14:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:14:23,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 94 [2024-10-24 05:14:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:14:23,558 INFO L225 Difference]: With dead ends: 91 [2024-10-24 05:14:23,558 INFO L226 Difference]: Without dead ends: 45 [2024-10-24 05:14:23,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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 05:14:23,565 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:14:23,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:14:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-24 05:14:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-24 05:14:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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 05:14:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2024-10-24 05:14:23,607 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 68 transitions. Word has length 94 [2024-10-24 05:14:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:14:23,609 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 68 transitions. [2024-10-24 05:14:23,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 05:14:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2024-10-24 05:14:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 05:14:23,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:14:23,613 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] [2024-10-24 05:14:23,622 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 05:14:23,814 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 05:14:23,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:14:23,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:14:23,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1709786180, now seen corresponding path program 1 times [2024-10-24 05:14:23,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:14:23,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856195897] [2024-10-24 05:14:23,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:14:23,816 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 05:14:23,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:14:23,818 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 05:14:23,820 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 05:14:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:14:23,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 05:14:23,999 INFO L278 TraceCheckSpWp]: Computing forward predicates...