./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_operatoramount_amount25_file-81.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_operatoramount_amount25_file-81.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 5057d6caf941992e771c1ecd13bfea36f973e8e9bf0cbce9da91139cce11df8f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:39:41,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:39:42,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:39:42,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:39:42,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:39:42,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:39:42,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:39:42,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:39:42,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:39:42,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:39:42,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:39:42,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:39:42,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:39:42,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:39:42,096 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:39:42,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:39:42,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:39:42,098 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:39:42,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:39:42,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:39:42,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:39:42,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:39:42,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:39:42,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:39:42,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:39:42,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:39:42,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:39:42,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:39:42,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:39:42,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:39:42,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:39:42,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:39:42,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:39:42,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:39:42,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:39:42,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:39:42,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:39:42,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:39:42,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:39:42,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:39:42,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:39:42,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:39:42,106 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 -> 5057d6caf941992e771c1ecd13bfea36f973e8e9bf0cbce9da91139cce11df8f [2024-10-24 10:39:42,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:39:42,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:39:42,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:39:42,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:39:42,334 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:39:42,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-81.i [2024-10-24 10:39:43,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:39:43,840 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:39:43,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-81.i [2024-10-24 10:39:43,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdd6102fa/ab4dcd46bdaf4e9cbfb674e043d85140/FLAGca13e872e [2024-10-24 10:39:43,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdd6102fa/ab4dcd46bdaf4e9cbfb674e043d85140 [2024-10-24 10:39:43,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:39:43,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:39:43,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:39:43,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:39:43,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:39:43,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:43" (1/1) ... [2024-10-24 10:39:43,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a733e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:43, skipping insertion in model container [2024-10-24 10:39:43,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:43" (1/1) ... [2024-10-24 10:39:43,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:39:44,037 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_operatoramount_amount25_file-81.i[915,928] [2024-10-24 10:39:44,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:39:44,101 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:39:44,113 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_operatoramount_amount25_file-81.i[915,928] [2024-10-24 10:39:44,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:39:44,148 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:39:44,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44 WrapperNode [2024-10-24 10:39:44,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:39:44,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:39:44,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:39:44,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:39:44,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,193 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-10-24 10:39:44,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:39:44,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:39:44,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:39:44,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:39:44,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,219 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 10:39:44,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:39:44,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:39:44,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:39:44,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:39:44,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (1/1) ... [2024-10-24 10:39:44,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:39:44,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:39:44,281 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 10:39:44,293 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 10:39:44,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:39:44,349 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:39:44,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:39:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:39:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:39:44,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:39:44,437 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:39:44,439 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:39:44,694 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 10:39:44,695 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:39:44,737 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:39:44,737 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:39:44,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:44 BoogieIcfgContainer [2024-10-24 10:39:44,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:39:44,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:39:44,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:39:44,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:39:44,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:39:43" (1/3) ... [2024-10-24 10:39:44,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1718a8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:44, skipping insertion in model container [2024-10-24 10:39:44,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:44" (2/3) ... [2024-10-24 10:39:44,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1718a8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:44, skipping insertion in model container [2024-10-24 10:39:44,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:44" (3/3) ... [2024-10-24 10:39:44,752 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-81.i [2024-10-24 10:39:44,765 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:39:44,765 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:39:44,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:39:44,818 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;@4d3b4df3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:39:44,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:39:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:39:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 10:39:44,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:44,838 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:44,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:44,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash -384781189, now seen corresponding path program 1 times [2024-10-24 10:39:44,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:44,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968922427] [2024-10-24 10:39:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:44,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:39:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:39:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:39:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 10:39:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:39:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 10:39:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:39:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:39:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:39:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:39:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:39:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:39:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:39:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:39:45,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:45,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968922427] [2024-10-24 10:39:45,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968922427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:45,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:45,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:39:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392555712] [2024-10-24 10:39:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:45,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:39:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:45,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:39:45,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:39:45,285 INFO L87 Difference]: Start difference. First operand has 59 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 10:39:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:45,325 INFO L93 Difference]: Finished difference Result 113 states and 194 transitions. [2024-10-24 10:39:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:39:45,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-10-24 10:39:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:45,340 INFO L225 Difference]: With dead ends: 113 [2024-10-24 10:39:45,340 INFO L226 Difference]: Without dead ends: 55 [2024-10-24 10:39:45,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 10:39:45,352 INFO L432 NwaCegarLoop]: 79 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, 79 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 10:39:45,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:39:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-24 10:39:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-24 10:39:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:39:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-10-24 10:39:45,415 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 104 [2024-10-24 10:39:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:45,419 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-10-24 10:39:45,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 10:39:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-10-24 10:39:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 10:39:45,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:45,422 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:45,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:39:45,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1526951299, now seen corresponding path program 1 times [2024-10-24 10:39:45,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:45,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973292704] [2024-10-24 10:39:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:45,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:39:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:39:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:39:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 10:39:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:39:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 10:39:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:39:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:39:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:39:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:39:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:39:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:39:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:39:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:39:45,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:45,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973292704] [2024-10-24 10:39:45,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973292704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:45,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:45,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:39:45,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827040563] [2024-10-24 10:39:45,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:45,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:39:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:39:45,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:39:45,797 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:45,865 INFO L93 Difference]: Finished difference Result 111 states and 166 transitions. [2024-10-24 10:39:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:39:45,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-10-24 10:39:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:45,867 INFO L225 Difference]: With dead ends: 111 [2024-10-24 10:39:45,868 INFO L226 Difference]: Without dead ends: 57 [2024-10-24 10:39:45,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:39:45,869 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:45,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:39:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-24 10:39:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-24 10:39:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:39:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2024-10-24 10:39:45,879 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 104 [2024-10-24 10:39:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:45,880 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2024-10-24 10:39:45,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2024-10-24 10:39:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 10:39:45,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:45,882 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:45,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:39:45,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:45,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1357171854, now seen corresponding path program 1 times [2024-10-24 10:39:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:45,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667822873] [2024-10-24 10:39:45,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:39:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:39:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:39:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 10:39:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:39:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 10:39:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:39:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:39:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:39:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:39:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:39:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:39:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:39:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:39:46,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667822873] [2024-10-24 10:39:46,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667822873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:46,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:46,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:39:46,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548258918] [2024-10-24 10:39:46,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:46,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:39:46,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:46,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:39:46,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:39:46,139 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:46,306 INFO L93 Difference]: Finished difference Result 181 states and 265 transitions. [2024-10-24 10:39:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:39:46,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-24 10:39:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:46,310 INFO L225 Difference]: With dead ends: 181 [2024-10-24 10:39:46,312 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 10:39:46,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:39:46,315 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 84 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:46,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 295 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:39:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 10:39:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2024-10-24 10:39:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 10:39:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 165 transitions. [2024-10-24 10:39:46,343 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 165 transitions. Word has length 105 [2024-10-24 10:39:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:46,345 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 165 transitions. [2024-10-24 10:39:46,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 165 transitions. [2024-10-24 10:39:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 10:39:46,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:46,348 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:46,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:39:46,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:46,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:46,349 INFO L85 PathProgramCache]: Analyzing trace with hash 770365840, now seen corresponding path program 1 times [2024-10-24 10:39:46,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:46,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471885599] [2024-10-24 10:39:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:39:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:39:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:39:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 10:39:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:39:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 10:39:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:39:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:39:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:39:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:39:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:39:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:39:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:39:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-24 10:39:46,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:46,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471885599] [2024-10-24 10:39:46,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471885599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:39:46,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560717982] [2024-10-24 10:39:46,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:46,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:39:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:39:46,689 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 10:39:46,693 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 10:39:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:46,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 10:39:46,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:39:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-10-24 10:39:46,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:39:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-24 10:39:47,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560717982] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:39:47,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 10:39:47,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-24 10:39:47,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318691719] [2024-10-24 10:39:47,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 10:39:47,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:39:47,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:47,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:39:47,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:39:47,146 INFO L87 Difference]: Start difference. First operand 111 states and 165 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 10:39:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:47,428 INFO L93 Difference]: Finished difference Result 310 states and 447 transitions. [2024-10-24 10:39:47,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 10:39:47,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 105 [2024-10-24 10:39:47,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:47,430 INFO L225 Difference]: With dead ends: 310 [2024-10-24 10:39:47,430 INFO L226 Difference]: Without dead ends: 200 [2024-10-24 10:39:47,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 238 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-24 10:39:47,432 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 309 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:47,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 184 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:39:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-24 10:39:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 185. [2024-10-24 10:39:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 130 states have (on average 1.2923076923076924) internal successors, (168), 130 states have internal predecessors, (168), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 10:39:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 264 transitions. [2024-10-24 10:39:47,473 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 264 transitions. Word has length 105 [2024-10-24 10:39:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:47,474 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 264 transitions. [2024-10-24 10:39:47,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 10:39:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 264 transitions. [2024-10-24 10:39:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 10:39:47,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:47,475 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:47,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 10:39:47,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:39:47,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:47,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:47,677 INFO L85 PathProgramCache]: Analyzing trace with hash 434597132, now seen corresponding path program 1 times [2024-10-24 10:39:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:47,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757034377] [2024-10-24 10:39:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:47,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:39:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:39:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:39:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 10:39:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:39:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 10:39:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:39:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:39:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:39:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:39:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:39:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:39:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:39:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:39:47,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:47,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757034377] [2024-10-24 10:39:47,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757034377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:47,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:47,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:39:47,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993994275] [2024-10-24 10:39:47,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:47,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:39:47,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:47,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:39:47,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:39:47,809 INFO L87 Difference]: Start difference. First operand 185 states and 264 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:47,861 INFO L93 Difference]: Finished difference Result 374 states and 532 transitions. [2024-10-24 10:39:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:39:47,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-24 10:39:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:47,866 INFO L225 Difference]: With dead ends: 374 [2024-10-24 10:39:47,866 INFO L226 Difference]: Without dead ends: 190 [2024-10-24 10:39:47,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:39:47,870 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 70 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:47,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 221 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:39:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-24 10:39:47,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 185. [2024-10-24 10:39:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 130 states have (on average 1.2769230769230768) internal successors, (166), 130 states have internal predecessors, (166), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 10:39:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 262 transitions. [2024-10-24 10:39:47,901 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 262 transitions. Word has length 105 [2024-10-24 10:39:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:47,902 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 262 transitions. [2024-10-24 10:39:47,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 262 transitions. [2024-10-24 10:39:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 10:39:47,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:47,903 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:47,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:39:47,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:47,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash 385649265, now seen corresponding path program 1 times [2024-10-24 10:39:47,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:47,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970381473] [2024-10-24 10:39:47,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:47,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:39:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:39:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:39:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 10:39:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:39:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 10:39:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:39:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:39:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:39:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:39:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:39:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:39:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:39:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:39:49,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:49,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970381473] [2024-10-24 10:39:49,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970381473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:49,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:49,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 10:39:49,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809522904] [2024-10-24 10:39:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:49,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 10:39:49,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:49,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 10:39:49,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-24 10:39:49,556 INFO L87 Difference]: Start difference. First operand 185 states and 262 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:51,095 INFO L93 Difference]: Finished difference Result 486 states and 670 transitions. [2024-10-24 10:39:51,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 10:39:51,096 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-24 10:39:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:51,098 INFO L225 Difference]: With dead ends: 486 [2024-10-24 10:39:51,098 INFO L226 Difference]: Without dead ends: 302 [2024-10-24 10:39:51,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=579, Unknown=0, NotChecked=0, Total=812 [2024-10-24 10:39:51,099 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 237 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:51,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 472 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 10:39:51,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-24 10:39:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 227. [2024-10-24 10:39:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 165 states have (on average 1.2606060606060605) internal successors, (208), 166 states have internal predecessors, (208), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 10:39:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 316 transitions. [2024-10-24 10:39:51,135 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 316 transitions. Word has length 107 [2024-10-24 10:39:51,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:51,137 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 316 transitions. [2024-10-24 10:39:51,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 316 transitions. [2024-10-24 10:39:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 10:39:51,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:51,139 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:51,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 10:39:51,139 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:51,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1652105319, now seen corresponding path program 1 times [2024-10-24 10:39:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:51,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610698301] [2024-10-24 10:39:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:39:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:39:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:39:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 10:39:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:39:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 10:39:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:39:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:39:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:39:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:39:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:39:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:39:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:39:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:39:51,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:51,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610698301] [2024-10-24 10:39:51,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610698301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:51,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:51,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:39:51,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687525627] [2024-10-24 10:39:51,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:51,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:39:51,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:51,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:39:51,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:39:51,312 INFO L87 Difference]: Start difference. First operand 227 states and 316 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:51,395 INFO L93 Difference]: Finished difference Result 612 states and 850 transitions. [2024-10-24 10:39:51,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:39:51,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-24 10:39:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:51,399 INFO L225 Difference]: With dead ends: 612 [2024-10-24 10:39:51,400 INFO L226 Difference]: Without dead ends: 397 [2024-10-24 10:39:51,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:39:51,401 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 79 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:51,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 245 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:39:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-24 10:39:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 301. [2024-10-24 10:39:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 220 states have (on average 1.2181818181818183) internal successors, (268), 222 states have internal predecessors, (268), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 10:39:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 408 transitions. [2024-10-24 10:39:51,439 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 408 transitions. Word has length 107 [2024-10-24 10:39:51,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:51,440 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 408 transitions. [2024-10-24 10:39:51,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 408 transitions. [2024-10-24 10:39:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 10:39:51,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:51,443 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:51,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 10:39:51,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:51,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:51,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1310708987, now seen corresponding path program 1 times [2024-10-24 10:39:51,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:51,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960118367] [2024-10-24 10:39:51,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:39:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:39:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:39:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 10:39:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:39:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 10:39:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:39:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:39:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:39:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:39:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:39:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:39:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:39:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:39:51,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:51,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960118367] [2024-10-24 10:39:51,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960118367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:51,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:51,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:39:51,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841517247] [2024-10-24 10:39:51,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:51,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:39:51,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:51,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:39:51,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:39:51,560 INFO L87 Difference]: Start difference. First operand 301 states and 408 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:51,691 INFO L93 Difference]: Finished difference Result 721 states and 977 transitions. [2024-10-24 10:39:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:39:51,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-10-24 10:39:51,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:51,695 INFO L225 Difference]: With dead ends: 721 [2024-10-24 10:39:51,695 INFO L226 Difference]: Without dead ends: 432 [2024-10-24 10:39:51,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:39:51,697 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 60 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:51,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 197 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:39:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-24 10:39:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 279. [2024-10-24 10:39:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.1464646464646464) internal successors, (227), 200 states have internal predecessors, (227), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 10:39:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 367 transitions. [2024-10-24 10:39:51,747 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 367 transitions. Word has length 108 [2024-10-24 10:39:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:51,747 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 367 transitions. [2024-10-24 10:39:51,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 367 transitions. [2024-10-24 10:39:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 10:39:51,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:51,749 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:51,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 10:39:51,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:51,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:51,749 INFO L85 PathProgramCache]: Analyzing trace with hash -984613720, now seen corresponding path program 1 times [2024-10-24 10:39:51,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:51,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788609773] [2024-10-24 10:39:51,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:51,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 10:39:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:39:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:39:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 10:39:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 10:39:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 10:39:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:39:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:39:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 10:39:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:39:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:39:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:39:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 10:39:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:39:54,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788609773] [2024-10-24 10:39:54,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788609773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:54,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:54,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 10:39:54,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821558371] [2024-10-24 10:39:54,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:54,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 10:39:54,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:54,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 10:39:54,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-24 10:39:54,095 INFO L87 Difference]: Start difference. First operand 279 states and 367 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:55,804 INFO L93 Difference]: Finished difference Result 332 states and 421 transitions. [2024-10-24 10:39:55,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 10:39:55,804 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-10-24 10:39:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:55,806 INFO L225 Difference]: With dead ends: 332 [2024-10-24 10:39:55,806 INFO L226 Difference]: Without dead ends: 330 [2024-10-24 10:39:55,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 10:39:55,807 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 274 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:55,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 456 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 10:39:55,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-24 10:39:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 284. [2024-10-24 10:39:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 203 states have (on average 1.1428571428571428) internal successors, (232), 205 states have internal predecessors, (232), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 10:39:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 372 transitions. [2024-10-24 10:39:55,837 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 372 transitions. Word has length 108 [2024-10-24 10:39:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:55,837 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 372 transitions. [2024-10-24 10:39:55,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:39:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 372 transitions. [2024-10-24 10:39:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 10:39:55,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:55,838 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:55,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 10:39:55,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:55,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:55,839 INFO L85 PathProgramCache]: Analyzing trace with hash -710951092, now seen corresponding path program 1 times [2024-10-24 10:39:55,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:55,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612558511] [2024-10-24 10:39:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:55,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:39:55,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:39:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:39:55,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:39:55,940 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:39:55,940 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:39:55,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 10:39:55,947 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:39:56,009 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:39:56,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:39:56 BoogieIcfgContainer [2024-10-24 10:39:56,015 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:39:56,016 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:39:56,016 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:39:56,016 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:39:56,016 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:44" (3/4) ... [2024-10-24 10:39:56,021 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:39:56,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:39:56,022 INFO L158 Benchmark]: Toolchain (without parser) took 12161.60ms. Allocated memory was 142.6MB in the beginning and 362.8MB in the end (delta: 220.2MB). Free memory was 70.7MB in the beginning and 195.0MB in the end (delta: -124.3MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-10-24 10:39:56,023 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 142.6MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:39:56,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.41ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 56.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:39:56,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.62ms. Allocated memory is still 142.6MB. Free memory was 56.3MB in the beginning and 53.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:39:56,023 INFO L158 Benchmark]: Boogie Preprocessor took 39.41ms. Allocated memory is still 142.6MB. Free memory was 53.9MB in the beginning and 51.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:39:56,023 INFO L158 Benchmark]: RCFGBuilder took 503.22ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 51.5MB in the beginning and 157.9MB in the end (delta: -106.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-10-24 10:39:56,024 INFO L158 Benchmark]: TraceAbstraction took 11271.57ms. Allocated memory was 205.5MB in the beginning and 362.8MB in the end (delta: 157.3MB). Free memory was 157.9MB in the beginning and 195.0MB in the end (delta: -37.1MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. [2024-10-24 10:39:56,024 INFO L158 Benchmark]: Witness Printer took 6.64ms. Allocated memory is still 362.8MB. Free memory is still 195.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:39:56,025 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 142.6MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.41ms. Allocated memory is still 142.6MB. Free memory was 70.7MB in the beginning and 56.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.62ms. Allocated memory is still 142.6MB. Free memory was 56.3MB in the beginning and 53.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.41ms. Allocated memory is still 142.6MB. Free memory was 53.9MB in the beginning and 51.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 503.22ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 51.5MB in the beginning and 157.9MB in the end (delta: -106.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11271.57ms. Allocated memory was 205.5MB in the beginning and 362.8MB in the end (delta: 157.3MB). Free memory was 157.9MB in the beginning and 195.0MB in the end (delta: -37.1MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. * Witness Printer took 6.64ms. Allocated memory is still 362.8MB. Free memory is still 195.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 4.5; [L25] double var_1_4 = 2.5; [L26] double var_1_5 = 0.0; [L27] double var_1_6 = 999999999999.3; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = -64; [L30] signed char var_1_12 = 5; [L31] signed char var_1_13 = 50; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_15 = 0; [L34] unsigned char var_1_16 = 0; [L35] unsigned char var_1_17 = 0; [L36] signed char last_1_var_1_7 = -128; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_7 = var_1_7 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L75] var_1_3 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L76] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L78] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L79] var_1_5 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_6=9999999999993/10, var_1_7=-128] [L80] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_6=9999999999993/10, var_1_7=-128] [L81] var_1_6 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L82] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L83] var_1_11 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L111] RET updateVariables() [L112] CALL step() [L40] signed long int stepLocal_1 = ((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7; VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L41] COND FALSE !(last_1_var_1_7 <= stepLocal_1) [L44] var_1_12 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L46] unsigned char stepLocal_3 = var_1_2; [L47] unsigned long int stepLocal_2 = (((25u) > (var_1_12)) ? (25u) : (var_1_12)); VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_2=25, stepLocal_3=-256, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L48] COND TRUE stepLocal_3 || var_1_15 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_2=25, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L49] COND TRUE stepLocal_2 <= var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L50] COND FALSE !(\read(var_1_2)) [L53] var_1_14 = var_1_17 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128] [L59] COND TRUE \read(var_1_14) [L60] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=-128] [L62] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=-128] [L62] signed long int stepLocal_0 = var_1_12 ^ var_1_12; [L63] COND TRUE ((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != stepLocal_0 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=-128] [L64] COND TRUE \read(var_1_14) [L65] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=25] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR (var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11))) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=25] [L103-L104] return (((var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11)))) && ((last_1_var_1_7 <= (((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7)) ? (var_1_12 == ((signed char) (var_1_13 - 1))) : (var_1_12 == ((signed char) var_1_11)))) && ((var_1_2 || var_1_15) ? ((((((25u) > (var_1_12)) ? (25u) : (var_1_12))) <= var_1_12) ? (var_1_2 ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_17))) : 1) : (var_1_14 == ((unsigned char) var_1_16))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=25] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1127 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1113 mSDsluCounter, 2345 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1603 mSDsCounter, 402 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1429 IncrementalHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 402 mSolverCounterUnsat, 742 mSDtfsCounter, 1429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 630 GetRequests, 537 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=7, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 404 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1167 NumberOfCodeBlocks, 1167 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1152 ConstructedInterpolants, 0 QuantifiedInterpolants, 3505 SizeOfPredicates, 2 NumberOfNonLiveVariables, 247 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 5262/5280 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 10:39:56,073 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_operatoramount_amount25_file-81.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 5057d6caf941992e771c1ecd13bfea36f973e8e9bf0cbce9da91139cce11df8f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:39:58,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:39:58,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:39:58,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:39:58,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:39:58,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:39:58,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:39:58,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:39:58,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:39:58,472 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:39:58,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:39:58,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:39:58,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:39:58,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:39:58,474 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:39:58,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:39:58,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:39:58,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:39:58,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:39:58,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:39:58,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:39:58,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:39:58,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:39:58,482 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:39:58,482 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:39:58,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:39:58,482 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:39:58,482 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:39:58,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:39:58,482 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:39:58,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:39:58,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:39:58,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:39:58,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:39:58,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:39:58,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:39:58,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:39:58,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:39:58,484 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:39:58,484 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:39:58,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:39:58,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:39:58,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:39:58,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:39:58,488 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:39:58,488 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 -> 5057d6caf941992e771c1ecd13bfea36f973e8e9bf0cbce9da91139cce11df8f [2024-10-24 10:39:58,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:39:58,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:39:58,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:39:58,795 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:39:58,795 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:39:58,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-81.i [2024-10-24 10:40:00,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:40:00,416 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:40:00,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-81.i [2024-10-24 10:40:00,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39cc84e3e/c57ab766531d4fc2a130b7157d70b9eb/FLAG2079c8db6 [2024-10-24 10:40:00,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39cc84e3e/c57ab766531d4fc2a130b7157d70b9eb [2024-10-24 10:40:00,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:40:00,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:40:00,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:00,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:40:00,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:40:00,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:00" (1/1) ... [2024-10-24 10:40:00,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51be0e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:00, skipping insertion in model container [2024-10-24 10:40:00,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:00" (1/1) ... [2024-10-24 10:40:00,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:40:00,977 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_operatoramount_amount25_file-81.i[915,928] [2024-10-24 10:40:01,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:01,049 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:40:01,058 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_operatoramount_amount25_file-81.i[915,928] [2024-10-24 10:40:01,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:01,116 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:40:01,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01 WrapperNode [2024-10-24 10:40:01,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:01,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:01,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:40:01,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:40:01,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,155 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-10-24 10:40:01,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:01,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:40:01,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:40:01,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:40:01,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,190 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 10:40:01,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:40:01,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:40:01,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:40:01,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:40:01,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (1/1) ... [2024-10-24 10:40:01,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:40:01,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:40:01,247 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 10:40:01,252 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 10:40:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:40:01,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:40:01,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:40:01,281 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:40:01,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:40:01,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:40:01,355 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:40:01,356 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:40:02,940 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 10:40:02,940 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:40:02,974 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:40:02,974 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:40:02,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:02 BoogieIcfgContainer [2024-10-24 10:40:02,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:40:02,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:40:02,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:40:02,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:40:02,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:40:00" (1/3) ... [2024-10-24 10:40:02,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc552fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:02, skipping insertion in model container [2024-10-24 10:40:02,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:01" (2/3) ... [2024-10-24 10:40:02,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc552fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:02, skipping insertion in model container [2024-10-24 10:40:03,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:02" (3/3) ... [2024-10-24 10:40:03,001 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-81.i [2024-10-24 10:40:03,013 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:40:03,014 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:40:03,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:40:03,081 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;@175c7a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:40:03,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:40:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:40:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 10:40:03,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:03,102 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:03,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:03,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:03,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2050707798, now seen corresponding path program 1 times [2024-10-24 10:40:03,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:40:03,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225475690] [2024-10-24 10:40:03,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:03,122 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 10:40:03,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:40:03,126 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 10:40:03,127 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 10:40:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:03,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 10:40:03,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:40:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:40:03,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:40:03,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:40:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225475690] [2024-10-24 10:40:03,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225475690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:03,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:03,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:40:03,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261111013] [2024-10-24 10:40:03,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:03,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:40:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:40:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:40:03,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:40:03,723 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:40:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:06,042 INFO L93 Difference]: Finished difference Result 144 states and 256 transitions. [2024-10-24 10:40:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:40:06,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2024-10-24 10:40:06,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:06,067 INFO L225 Difference]: With dead ends: 144 [2024-10-24 10:40:06,067 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 10:40:06,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:40:06,074 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 52 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:06,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 10:40:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 10:40:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-10-24 10:40:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 10:40:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2024-10-24 10:40:06,126 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 133 transitions. Word has length 101 [2024-10-24 10:40:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:06,127 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 133 transitions. [2024-10-24 10:40:06,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:40:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 133 transitions. [2024-10-24 10:40:06,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 10:40:06,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:06,134 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:06,147 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 10:40:06,334 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 10:40:06,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:06,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1370649428, now seen corresponding path program 1 times [2024-10-24 10:40:06,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:40:06,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797312089] [2024-10-24 10:40:06,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:06,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:40:06,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:40:06,344 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 10:40:06,346 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 10:40:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:06,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 10:40:06,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:40:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-10-24 10:40:06,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:40:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-24 10:40:06,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:40:06,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797312089] [2024-10-24 10:40:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797312089] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:40:06,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 10:40:06,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-24 10:40:06,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67214799] [2024-10-24 10:40:06,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 10:40:06,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:40:06,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:40:06,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:40:06,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:40:06,826 INFO L87 Difference]: Start difference. First operand 89 states and 133 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 10:40:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:09,136 INFO L93 Difference]: Finished difference Result 250 states and 360 transitions. [2024-10-24 10:40:09,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 10:40:09,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 101 [2024-10-24 10:40:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:09,139 INFO L225 Difference]: With dead ends: 250 [2024-10-24 10:40:09,139 INFO L226 Difference]: Without dead ends: 162 [2024-10-24 10:40:09,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-24 10:40:09,141 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 161 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:09,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 135 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 10:40:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-24 10:40:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 147. [2024-10-24 10:40:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 92 states have internal predecessors, (113), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 10:40:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 209 transitions. [2024-10-24 10:40:09,161 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 209 transitions. Word has length 101 [2024-10-24 10:40:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:09,162 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 209 transitions. [2024-10-24 10:40:09,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 10:40:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 209 transitions. [2024-10-24 10:40:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 10:40:09,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:09,164 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:09,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 10:40:09,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:40:09,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:09,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1313391126, now seen corresponding path program 1 times [2024-10-24 10:40:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:40:09,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170183785] [2024-10-24 10:40:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:09,367 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 10:40:09,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:40:09,370 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:40:09,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 10:40:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:09,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 10:40:09,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:40:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 10:40:09,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:40:09,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:40:09,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170183785] [2024-10-24 10:40:09,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170183785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:09,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:09,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:40:09,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346085050] [2024-10-24 10:40:09,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:09,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:40:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:40:09,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:40:09,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:40:09,568 INFO L87 Difference]: Start difference. First operand 147 states and 209 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:40:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:10,952 INFO L93 Difference]: Finished difference Result 242 states and 344 transitions. [2024-10-24 10:40:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:40:10,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2024-10-24 10:40:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:10,956 INFO L225 Difference]: With dead ends: 242 [2024-10-24 10:40:10,957 INFO L226 Difference]: Without dead ends: 147 [2024-10-24 10:40:10,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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 10:40:10,959 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:10,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 10:40:10,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-24 10:40:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-24 10:40:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 10:40:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 205 transitions. [2024-10-24 10:40:11,020 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 205 transitions. Word has length 101 [2024-10-24 10:40:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:11,020 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 205 transitions. [2024-10-24 10:40:11,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 10:40:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 205 transitions. [2024-10-24 10:40:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 10:40:11,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:11,026 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:11,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 10:40:11,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:40:11,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:11,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:11,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2069835088, now seen corresponding path program 1 times [2024-10-24 10:40:11,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:40:11,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665110584] [2024-10-24 10:40:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:11,230 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 10:40:11,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:40:11,236 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:40:11,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 10:40:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:11,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 10:40:11,457 INFO L278 TraceCheckSpWp]: Computing forward predicates...