./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.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 ec4c283737f978fa6d4250af6fdc7ba2dca7c6fa1da6a09eddd2e4614bb3b424 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 06:50:16,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 06:50:16,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 06:50:16,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 06:50:16,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 06:50:16,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 06:50:16,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 06:50:16,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 06:50:16,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 06:50:16,198 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 06:50:16,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 06:50:16,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 06:50:16,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 06:50:16,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 06:50:16,202 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 06:50:16,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 06:50:16,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 06:50:16,203 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 06:50:16,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 06:50:16,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 06:50:16,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 06:50:16,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 06:50:16,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 06:50:16,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 06:50:16,208 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 06:50:16,208 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 06:50:16,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 06:50:16,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 06:50:16,209 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 06:50:16,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 06:50:16,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 06:50:16,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 06:50:16,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:50:16,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 06:50:16,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 06:50:16,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 06:50:16,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 06:50:16,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 06:50:16,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 06:50:16,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 06:50:16,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 06:50:16,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 06:50:16,211 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 -> ec4c283737f978fa6d4250af6fdc7ba2dca7c6fa1da6a09eddd2e4614bb3b424 [2024-11-22 06:50:16,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 06:50:16,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 06:50:16,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 06:50:16,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 06:50:16,427 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 06:50:16,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i [2024-11-22 06:50:17,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 06:50:17,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 06:50:17,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i [2024-11-22 06:50:17,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cbb6e871/2de36a02bf1d48cf8fab6a9b204e9b52/FLAG056b3fbaf [2024-11-22 06:50:18,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cbb6e871/2de36a02bf1d48cf8fab6a9b204e9b52 [2024-11-22 06:50:18,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 06:50:18,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 06:50:18,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 06:50:18,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 06:50:18,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 06:50:18,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ac8f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18, skipping insertion in model container [2024-11-22 06:50:18,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 06:50:18,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i[913,926] [2024-11-22 06:50:18,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:50:18,449 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 06:50:18,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i[913,926] [2024-11-22 06:50:18,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:50:18,493 INFO L204 MainTranslator]: Completed translation [2024-11-22 06:50:18,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18 WrapperNode [2024-11-22 06:50:18,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 06:50:18,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 06:50:18,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 06:50:18,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 06:50:18,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,542 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-22 06:50:18,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 06:50:18,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 06:50:18,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 06:50:18,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 06:50:18,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,575 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-11-22 06:50:18,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 06:50:18,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 06:50:18,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 06:50:18,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 06:50:18,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (1/1) ... [2024-11-22 06:50:18,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:50:18,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:50:18,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 06:50:18,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 06:50:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 06:50:18,682 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 06:50:18,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 06:50:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 06:50:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 06:50:18,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 06:50:18,737 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 06:50:18,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 06:50:19,015 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-22 06:50:19,017 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 06:50:19,027 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 06:50:19,027 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 06:50:19,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:50:19 BoogieIcfgContainer [2024-11-22 06:50:19,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 06:50:19,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 06:50:19,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 06:50:19,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 06:50:19,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:50:18" (1/3) ... [2024-11-22 06:50:19,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab4e513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:50:19, skipping insertion in model container [2024-11-22 06:50:19,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:18" (2/3) ... [2024-11-22 06:50:19,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab4e513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:50:19, skipping insertion in model container [2024-11-22 06:50:19,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:50:19" (3/3) ... [2024-11-22 06:50:19,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-42.i [2024-11-22 06:50:19,047 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 06:50:19,047 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 06:50:19,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 06:50:19,094 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;@52236f33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 06:50:19,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 06:50:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 06:50:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 06:50:19,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:19,106 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:19,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:19,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:19,112 INFO L85 PathProgramCache]: Analyzing trace with hash 992786080, now seen corresponding path program 1 times [2024-11-22 06:50:19,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:50:19,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915098398] [2024-11-22 06:50:19,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:19,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:50:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-22 06:50:19,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:50:19,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915098398] [2024-11-22 06:50:19,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915098398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 06:50:19,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290744557] [2024-11-22 06:50:19,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:19,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:50:19,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:50:19,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 06:50:19,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 06:50:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:19,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 06:50:19,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-22 06:50:19,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:50:19,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290744557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:50:19,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 06:50:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 06:50:19,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822653522] [2024-11-22 06:50:19,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:50:19,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 06:50:19,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:50:19,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 06:50:19,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 06:50:19,505 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 06:50:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:19,526 INFO L93 Difference]: Finished difference Result 99 states and 162 transitions. [2024-11-22 06:50:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 06:50:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2024-11-22 06:50:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:19,533 INFO L225 Difference]: With dead ends: 99 [2024-11-22 06:50:19,534 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 06:50:19,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 06:50:19,539 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:19,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 06:50:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 06:50:19,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 06:50:19,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 06:50:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2024-11-22 06:50:19,570 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 87 [2024-11-22 06:50:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:19,573 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-11-22 06:50:19,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 06:50:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2024-11-22 06:50:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 06:50:19,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:19,577 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:19,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 06:50:19,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 06:50:19,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:19,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash -384634916, now seen corresponding path program 1 times [2024-11-22 06:50:19,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:50:19,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295842929] [2024-11-22 06:50:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:50:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 06:50:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:50:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295842929] [2024-11-22 06:50:20,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295842929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:50:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:50:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 06:50:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924193101] [2024-11-22 06:50:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:50:20,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 06:50:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:50:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 06:50:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 06:50:20,150 INFO L87 Difference]: Start difference. First operand 49 states and 71 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:20,242 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2024-11-22 06:50:20,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 06:50:20,246 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-11-22 06:50:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:20,247 INFO L225 Difference]: With dead ends: 142 [2024-11-22 06:50:20,247 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 06:50:20,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-11-22 06:50:20,250 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 70 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:20,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 195 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 06:50:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 06:50:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2024-11-22 06:50:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 06:50:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2024-11-22 06:50:20,272 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 87 [2024-11-22 06:50:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:20,273 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2024-11-22 06:50:20,273 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2024-11-22 06:50:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 06:50:20,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:20,275 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:20,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 06:50:20,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:20,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash 734981921, now seen corresponding path program 1 times [2024-11-22 06:50:20,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:50:20,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393195434] [2024-11-22 06:50:20,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:20,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:50:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 06:50:20,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:50:20,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393195434] [2024-11-22 06:50:20,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393195434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:50:20,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:50:20,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 06:50:20,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361780794] [2024-11-22 06:50:20,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:50:20,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 06:50:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:50:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 06:50:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 06:50:20,606 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:20,702 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2024-11-22 06:50:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 06:50:20,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-22 06:50:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:20,704 INFO L225 Difference]: With dead ends: 121 [2024-11-22 06:50:20,704 INFO L226 Difference]: Without dead ends: 75 [2024-11-22 06:50:20,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-11-22 06:50:20,706 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 66 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:20,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 93 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 06:50:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-22 06:50:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-22 06:50:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 06:50:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2024-11-22 06:50:20,716 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 88 [2024-11-22 06:50:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:20,716 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2024-11-22 06:50:20,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2024-11-22 06:50:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 06:50:20,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:20,717 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:20,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 06:50:20,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:20,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1415040291, now seen corresponding path program 1 times [2024-11-22 06:50:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:50:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042359269] [2024-11-22 06:50:20,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:50:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 06:50:20,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:50:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042359269] [2024-11-22 06:50:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042359269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:50:20,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:50:20,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 06:50:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588859246] [2024-11-22 06:50:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:50:20,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 06:50:20,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:50:20,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 06:50:20,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 06:50:20,924 INFO L87 Difference]: Start difference. First operand 75 states and 107 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:21,123 INFO L93 Difference]: Finished difference Result 211 states and 305 transitions. [2024-11-22 06:50:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 06:50:21,124 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-22 06:50:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:21,129 INFO L225 Difference]: With dead ends: 211 [2024-11-22 06:50:21,129 INFO L226 Difference]: Without dead ends: 165 [2024-11-22 06:50:21,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 06:50:21,133 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 97 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:21,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 290 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 06:50:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-22 06:50:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 119. [2024-11-22 06:50:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 06:50:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-22 06:50:21,170 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 88 [2024-11-22 06:50:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:21,171 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-22 06:50:21,171 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-22 06:50:21,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 06:50:21,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:21,172 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:21,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 06:50:21,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:21,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:21,173 INFO L85 PathProgramCache]: Analyzing trace with hash 135176613, now seen corresponding path program 1 times [2024-11-22 06:50:21,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:50:21,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814237374] [2024-11-22 06:50:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:50:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-22 06:50:21,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:50:21,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814237374] [2024-11-22 06:50:21,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814237374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 06:50:21,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615839536] [2024-11-22 06:50:21,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:50:21,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:50:21,575 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 06:50:21,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 06:50:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:21,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 06:50:21,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-22 06:50:21,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 06:50:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-22 06:50:22,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615839536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 06:50:22,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 06:50:22,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-22 06:50:22,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41606529] [2024-11-22 06:50:22,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 06:50:22,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 06:50:22,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:50:22,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 06:50:22,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-22 06:50:22,074 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-22 06:50:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:22,745 INFO L93 Difference]: Finished difference Result 382 states and 511 transitions. [2024-11-22 06:50:22,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-22 06:50:22,746 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 88 [2024-11-22 06:50:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:22,748 INFO L225 Difference]: With dead ends: 382 [2024-11-22 06:50:22,748 INFO L226 Difference]: Without dead ends: 336 [2024-11-22 06:50:22,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=482, Invalid=1410, Unknown=0, NotChecked=0, Total=1892 [2024-11-22 06:50:22,749 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 363 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:22,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 358 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 06:50:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-22 06:50:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 204. [2024-11-22 06:50:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 143 states have internal predecessors, (177), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 06:50:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 273 transitions. [2024-11-22 06:50:22,778 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 273 transitions. Word has length 88 [2024-11-22 06:50:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:22,778 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 273 transitions. [2024-11-22 06:50:22,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-22 06:50:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 273 transitions. [2024-11-22 06:50:22,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 06:50:22,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:22,783 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:22,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 06:50:22,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:50:22,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:22,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash -875940637, now seen corresponding path program 1 times [2024-11-22 06:50:22,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:50:22,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709007667] [2024-11-22 06:50:22,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:22,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:50:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 06:50:23,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064920388] [2024-11-22 06:50:23,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:23,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:50:23,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:50:23,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 06:50:23,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 06:50:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:23,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 06:50:23,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-22 06:50:23,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 06:50:23,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:50:23,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709007667] [2024-11-22 06:50:23,845 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 06:50:23,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064920388] [2024-11-22 06:50:23,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064920388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 06:50:23,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-22 06:50:23,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-22 06:50:23,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178409160] [2024-11-22 06:50:23,846 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-22 06:50:23,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 06:50:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:50:23,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 06:50:23,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-22 06:50:23,847 INFO L87 Difference]: Start difference. First operand 204 states and 273 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 06:50:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:24,283 INFO L93 Difference]: Finished difference Result 618 states and 807 transitions. [2024-11-22 06:50:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 06:50:24,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2024-11-22 06:50:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:24,286 INFO L225 Difference]: With dead ends: 618 [2024-11-22 06:50:24,287 INFO L226 Difference]: Without dead ends: 513 [2024-11-22 06:50:24,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2024-11-22 06:50:24,288 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 156 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:24,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 426 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 06:50:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-22 06:50:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 424. [2024-11-22 06:50:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 308 states have (on average 1.2402597402597402) internal successors, (382), 310 states have internal predecessors, (382), 88 states have call successors, (88), 27 states have call predecessors, (88), 27 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-22 06:50:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 558 transitions. [2024-11-22 06:50:24,334 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 558 transitions. Word has length 88 [2024-11-22 06:50:24,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:24,336 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 558 transitions. [2024-11-22 06:50:24,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 06:50:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 558 transitions. [2024-11-22 06:50:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 06:50:24,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:24,338 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:24,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 06:50:24,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:50:24,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:24,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:24,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1462746651, now seen corresponding path program 1 times [2024-11-22 06:50:24,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:50:24,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767386740] [2024-11-22 06:50:24,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:24,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:50:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 06:50:24,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927418204] [2024-11-22 06:50:24,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:24,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:50:24,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:50:24,584 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 06:50:24,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 06:50:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:24,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-22 06:50:24,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-22 06:50:25,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 06:50:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 06:50:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767386740] [2024-11-22 06:50:25,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 06:50:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927418204] [2024-11-22 06:50:25,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927418204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 06:50:25,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-22 06:50:25,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-22 06:50:25,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766665959] [2024-11-22 06:50:25,511 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-22 06:50:25,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 06:50:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 06:50:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 06:50:25,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-22 06:50:25,512 INFO L87 Difference]: Start difference. First operand 424 states and 558 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 06:50:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:26,041 INFO L93 Difference]: Finished difference Result 833 states and 1104 transitions. [2024-11-22 06:50:26,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 06:50:26,042 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2024-11-22 06:50:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:26,047 INFO L225 Difference]: With dead ends: 833 [2024-11-22 06:50:26,048 INFO L226 Difference]: Without dead ends: 672 [2024-11-22 06:50:26,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-11-22 06:50:26,049 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 126 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:26,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 511 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 06:50:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-22 06:50:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 535. [2024-11-22 06:50:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 387 states have (on average 1.2325581395348837) internal successors, (477), 389 states have internal predecessors, (477), 112 states have call successors, (112), 35 states have call predecessors, (112), 35 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-22 06:50:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 701 transitions. [2024-11-22 06:50:26,107 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 701 transitions. Word has length 88 [2024-11-22 06:50:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:26,107 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 701 transitions. [2024-11-22 06:50:26,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 06:50:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 701 transitions. [2024-11-22 06:50:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 06:50:26,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:26,109 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:26,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 06:50:26,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:50:26,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:26,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:26,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1226323989, now seen corresponding path program 1 times [2024-11-22 06:50:26,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 06:50:26,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57871662] [2024-11-22 06:50:26,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:26,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 06:50:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 06:50:26,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528386423] [2024-11-22 06:50:26,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:26,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:50:26,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:50:26,362 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 06:50:26,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 06:50:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 06:50:26,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 06:50:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 06:50:26,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 06:50:26,562 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 06:50:26,562 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 06:50:26,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 06:50:26,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 06:50:26,769 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:26,836 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 06:50:26,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:50:26 BoogieIcfgContainer [2024-11-22 06:50:26,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 06:50:26,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 06:50:26,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 06:50:26,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 06:50:26,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:50:19" (3/4) ... [2024-11-22 06:50:26,844 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 06:50:26,845 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 06:50:26,846 INFO L158 Benchmark]: Toolchain (without parser) took 8613.82ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 105.7MB in the beginning and 184.6MB in the end (delta: -78.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 06:50:26,846 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 06:50:26,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.34ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 90.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 06:50:26,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.06ms. Allocated memory is still 176.2MB. Free memory was 89.7MB in the beginning and 86.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 06:50:26,846 INFO L158 Benchmark]: Boogie Preprocessor took 49.69ms. Allocated memory is still 176.2MB. Free memory was 86.4MB in the beginning and 81.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 06:50:26,847 INFO L158 Benchmark]: RCFGBuilder took 429.85ms. Allocated memory is still 176.2MB. Free memory was 81.0MB in the beginning and 135.4MB in the end (delta: -54.4MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-22 06:50:26,847 INFO L158 Benchmark]: TraceAbstraction took 7812.38ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 134.5MB in the beginning and 184.6MB in the end (delta: -50.1MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. [2024-11-22 06:50:26,847 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 220.2MB. Free memory is still 184.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 06:50:26,848 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.14ms. Allocated memory is still 121.6MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.34ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 90.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.06ms. Allocated memory is still 176.2MB. Free memory was 89.7MB in the beginning and 86.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.69ms. Allocated memory is still 176.2MB. Free memory was 86.4MB in the beginning and 81.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 429.85ms. Allocated memory is still 176.2MB. Free memory was 81.0MB in the beginning and 135.4MB in the end (delta: -54.4MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7812.38ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 134.5MB in the beginning and 184.6MB in the end (delta: -50.1MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 220.2MB. Free memory is still 184.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] signed short int last_1_var_1_1 = 16; [L37] unsigned char last_1_var_1_6 = 10; [L38] unsigned char last_1_var_1_8 = 1; [L39] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_6 = var_1_6 [L119] last_1_var_1_8 = var_1_8 [L120] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L96] var_1_5 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L97] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L98] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L98] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=128, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L100] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L101] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L101] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L104] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L104] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L105] var_1_12 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L106] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L107] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L107] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L108] var_1_15 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L109] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L111] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L112] var_1_20 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L114] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L114] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L131] RET updateVariables() [L132] CALL step() [L43] signed long int stepLocal_6 = last_1_var_1_1; [L44] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L45] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L46] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L49] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L54] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=10, var_1_7=-285, var_1_8=1] [L57] COND TRUE var_1_5 >= -2 [L58] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=1] [L60] unsigned char stepLocal_4 = var_1_6; [L61] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=127, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=1] [L62] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=127, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=1] [L63] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L64] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=1] [L71] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=127, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=1] [L72] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=1] [L75] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=1] [L76] COND TRUE \read(var_1_19) [L77] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=1] [L83] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L84] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, stepLocal_1=-285, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=1] [L85] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L92] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, stepLocal_1=-285, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=0] [L132] RET step() [L133] CALL, EXPR property() [L123-L124] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=0] [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_5=126, var_1_6=127, var_1_7=-285, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 892 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 878 mSDsluCounter, 1944 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1379 mSDsCounter, 290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1224 IncrementalHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 290 mSolverCounterUnsat, 565 mSDtfsCounter, 1224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 661 GetRequests, 559 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=535occurred in iteration=7, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 425 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1143 NumberOfCodeBlocks, 1143 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 867 ConstructedInterpolants, 2 QuantifiedInterpolants, 3473 SizeOfPredicates, 16 NumberOfNonLiveVariables, 930 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 2534/2640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 06:50:26,871 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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.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 ec4c283737f978fa6d4250af6fdc7ba2dca7c6fa1da6a09eddd2e4614bb3b424 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 06:50:28,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 06:50:28,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 06:50:28,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 06:50:28,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 06:50:28,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 06:50:28,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 06:50:28,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 06:50:28,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 06:50:28,808 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 06:50:28,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 06:50:28,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 06:50:28,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 06:50:28,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 06:50:28,810 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 06:50:28,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 06:50:28,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 06:50:28,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 06:50:28,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 06:50:28,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 06:50:28,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 06:50:28,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 06:50:28,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 06:50:28,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 06:50:28,816 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 06:50:28,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 06:50:28,817 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 06:50:28,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 06:50:28,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 06:50:28,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 06:50:28,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 06:50:28,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 06:50:28,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 06:50:28,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 06:50:28,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:50:28,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 06:50:28,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 06:50:28,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 06:50:28,821 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 06:50:28,821 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 06:50:28,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 06:50:28,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 06:50:28,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 06:50:28,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 06:50:28,822 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 -> ec4c283737f978fa6d4250af6fdc7ba2dca7c6fa1da6a09eddd2e4614bb3b424 [2024-11-22 06:50:29,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 06:50:29,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 06:50:29,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 06:50:29,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 06:50:29,099 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 06:50:29,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i [2024-11-22 06:50:30,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 06:50:30,500 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 06:50:30,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i [2024-11-22 06:50:30,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a023c71/c3761b14dfd24e0f8b2b40f5a9c61dc8/FLAG1b31eebfb [2024-11-22 06:50:30,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a023c71/c3761b14dfd24e0f8b2b40f5a9c61dc8 [2024-11-22 06:50:30,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 06:50:30,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 06:50:30,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 06:50:30,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 06:50:30,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 06:50:30,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:50:30" (1/1) ... [2024-11-22 06:50:30,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b59aa7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:30, skipping insertion in model container [2024-11-22 06:50:30,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:50:30" (1/1) ... [2024-11-22 06:50:30,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 06:50:31,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i[913,926] [2024-11-22 06:50:31,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:50:31,158 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 06:50:31,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-42.i[913,926] [2024-11-22 06:50:31,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 06:50:31,216 INFO L204 MainTranslator]: Completed translation [2024-11-22 06:50:31,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31 WrapperNode [2024-11-22 06:50:31,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 06:50:31,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 06:50:31,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 06:50:31,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 06:50:31,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,262 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-22 06:50:31,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 06:50:31,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 06:50:31,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 06:50:31,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 06:50:31,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,290 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-11-22 06:50:31,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 06:50:31,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 06:50:31,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 06:50:31,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 06:50:31,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (1/1) ... [2024-11-22 06:50:31,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 06:50:31,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 06:50:31,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 06:50:31,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 06:50:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 06:50:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 06:50:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 06:50:31,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 06:50:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 06:50:31,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 06:50:31,440 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 06:50:31,441 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 06:50:31,790 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-22 06:50:31,790 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 06:50:31,803 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 06:50:31,804 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 06:50:31,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:50:31 BoogieIcfgContainer [2024-11-22 06:50:31,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 06:50:31,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 06:50:31,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 06:50:31,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 06:50:31,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:50:30" (1/3) ... [2024-11-22 06:50:31,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22aa0717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:50:31, skipping insertion in model container [2024-11-22 06:50:31,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:50:31" (2/3) ... [2024-11-22 06:50:31,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22aa0717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:50:31, skipping insertion in model container [2024-11-22 06:50:31,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:50:31" (3/3) ... [2024-11-22 06:50:31,812 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-42.i [2024-11-22 06:50:31,824 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 06:50:31,825 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 06:50:31,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 06:50:31,871 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;@69cd5d1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 06:50:31,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 06:50:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 06:50:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 06:50:31,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:31,884 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:31,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:31,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash 992786080, now seen corresponding path program 1 times [2024-11-22 06:50:31,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:50:31,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904231067] [2024-11-22 06:50:31,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:31,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:31,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:50:31,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 06:50:31,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 06:50:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:32,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 06:50:32,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-22 06:50:32,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:50:32,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:50:32,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904231067] [2024-11-22 06:50:32,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904231067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:50:32,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:50:32,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 06:50:32,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724842708] [2024-11-22 06:50:32,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:50:32,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 06:50:32,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 06:50:32,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 06:50:32,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 06:50:32,145 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 06:50:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:32,163 INFO L93 Difference]: Finished difference Result 99 states and 162 transitions. [2024-11-22 06:50:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 06:50:32,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2024-11-22 06:50:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:32,169 INFO L225 Difference]: With dead ends: 99 [2024-11-22 06:50:32,169 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 06:50:32,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 06:50:32,174 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:32,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 06:50:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 06:50:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 06:50:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 06:50:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2024-11-22 06:50:32,209 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 87 [2024-11-22 06:50:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:32,209 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-11-22 06:50:32,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 06:50:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2024-11-22 06:50:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 06:50:32,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:32,212 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:32,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 06:50:32,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:32,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:32,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash -384634916, now seen corresponding path program 1 times [2024-11-22 06:50:32,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:50:32,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426763921] [2024-11-22 06:50:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:32,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:32,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:50:32,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 06:50:32,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 06:50:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:32,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 06:50:32,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 06:50:32,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:50:32,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:50:32,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426763921] [2024-11-22 06:50:32,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426763921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:50:32,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:50:32,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 06:50:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234639320] [2024-11-22 06:50:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:50:32,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 06:50:32,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 06:50:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 06:50:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 06:50:32,756 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:33,004 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2024-11-22 06:50:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 06:50:33,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-11-22 06:50:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:33,011 INFO L225 Difference]: With dead ends: 142 [2024-11-22 06:50:33,011 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 06:50:33,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 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-11-22 06:50:33,013 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:33,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 195 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 06:50:33,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 06:50:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2024-11-22 06:50:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-22 06:50:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2024-11-22 06:50:33,027 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 87 [2024-11-22 06:50:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:33,028 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2024-11-22 06:50:33,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2024-11-22 06:50:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 06:50:33,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:33,029 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:33,037 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-11-22 06:50:33,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:33,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:33,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash 734981921, now seen corresponding path program 1 times [2024-11-22 06:50:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:50:33,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742920474] [2024-11-22 06:50:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:33,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:33,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:50:33,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 06:50:33,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 06:50:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:33,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 06:50:33,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 06:50:33,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:50:33,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:50:33,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742920474] [2024-11-22 06:50:33,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742920474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:50:33,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:50:33,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 06:50:33,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539403718] [2024-11-22 06:50:33,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:50:33,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 06:50:33,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 06:50:33,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 06:50:33,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 06:50:33,727 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:34,251 INFO L93 Difference]: Finished difference Result 211 states and 311 transitions. [2024-11-22 06:50:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 06:50:34,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-22 06:50:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:34,258 INFO L225 Difference]: With dead ends: 211 [2024-11-22 06:50:34,258 INFO L226 Difference]: Without dead ends: 165 [2024-11-22 06:50:34,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 06:50:34,262 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 97 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:34,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 294 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 06:50:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-22 06:50:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 119. [2024-11-22 06:50:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 06:50:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2024-11-22 06:50:34,287 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 88 [2024-11-22 06:50:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:34,288 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2024-11-22 06:50:34,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2024-11-22 06:50:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 06:50:34,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:34,289 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:34,299 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-11-22 06:50:34,493 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-11-22 06:50:34,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:34,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash -544881757, now seen corresponding path program 1 times [2024-11-22 06:50:34,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:50:34,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623721465] [2024-11-22 06:50:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:34,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:34,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:50:34,497 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-11-22 06:50:34,498 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-11-22 06:50:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:34,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 06:50:34,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 06:50:34,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:50:34,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:50:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623721465] [2024-11-22 06:50:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623721465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:50:34,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 06:50:34,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 06:50:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481486481] [2024-11-22 06:50:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:50:34,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 06:50:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 06:50:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 06:50:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 06:50:34,651 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:34,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:34,779 INFO L93 Difference]: Finished difference Result 209 states and 308 transitions. [2024-11-22 06:50:34,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 06:50:34,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-22 06:50:34,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:34,785 INFO L225 Difference]: With dead ends: 209 [2024-11-22 06:50:34,786 INFO L226 Difference]: Without dead ends: 119 [2024-11-22 06:50:34,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 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-11-22 06:50:34,787 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:34,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 06:50:34,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-22 06:50:34,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-22 06:50:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 06:50:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-22 06:50:34,808 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 88 [2024-11-22 06:50:34,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:34,808 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-22 06:50:34,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-22 06:50:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 06:50:34,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:34,812 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:34,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 06:50:35,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:35,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:35,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:35,014 INFO L85 PathProgramCache]: Analyzing trace with hash 135176613, now seen corresponding path program 1 times [2024-11-22 06:50:35,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:50:35,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162065062] [2024-11-22 06:50:35,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:35,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:50:35,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 06:50:35,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 06:50:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:35,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 06:50:35,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-22 06:50:35,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 06:50:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-22 06:50:35,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:50:35,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162065062] [2024-11-22 06:50:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162065062] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 06:50:35,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 06:50:35,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-22 06:50:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528287270] [2024-11-22 06:50:35,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 06:50:35,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 06:50:35,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 06:50:35,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 06:50:35,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-22 06:50:35,569 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 06:50:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:36,357 INFO L93 Difference]: Finished difference Result 276 states and 367 transitions. [2024-11-22 06:50:36,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-22 06:50:36,357 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 88 [2024-11-22 06:50:36,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:36,359 INFO L225 Difference]: With dead ends: 276 [2024-11-22 06:50:36,359 INFO L226 Difference]: Without dead ends: 230 [2024-11-22 06:50:36,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-22 06:50:36,361 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 151 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:36,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 375 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 06:50:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-22 06:50:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 204. [2024-11-22 06:50:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 143 states have internal predecessors, (177), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 06:50:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 273 transitions. [2024-11-22 06:50:36,391 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 273 transitions. Word has length 88 [2024-11-22 06:50:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:36,392 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 273 transitions. [2024-11-22 06:50:36,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-22 06:50:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 273 transitions. [2024-11-22 06:50:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 06:50:36,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:36,393 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:36,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 06:50:36,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:36,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:36,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash -875940637, now seen corresponding path program 1 times [2024-11-22 06:50:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:50:36,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633952962] [2024-11-22 06:50:36,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:36,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:36,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:50:36,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 06:50:36,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 06:50:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:36,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 06:50:36,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-22 06:50:37,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 06:50:37,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:50:37,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633952962] [2024-11-22 06:50:37,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633952962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 06:50:37,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [732985198] [2024-11-22 06:50:37,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:37,301 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 06:50:37,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 06:50:37,304 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 06:50:37,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-22 06:50:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:37,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 06:50:37,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 06:50:37,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:50:37,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [732985198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:50:37,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 06:50:37,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-22 06:50:37,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978532163] [2024-11-22 06:50:37,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:50:37,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 06:50:37,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 06:50:37,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 06:50:37,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-22 06:50:37,938 INFO L87 Difference]: Start difference. First operand 204 states and 273 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:39,117 INFO L93 Difference]: Finished difference Result 586 states and 779 transitions. [2024-11-22 06:50:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 06:50:39,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-22 06:50:39,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:39,126 INFO L225 Difference]: With dead ends: 586 [2024-11-22 06:50:39,127 INFO L226 Difference]: Without dead ends: 481 [2024-11-22 06:50:39,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-22 06:50:39,129 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 115 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:39,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 334 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 06:50:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-22 06:50:39,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 408. [2024-11-22 06:50:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 296 states have (on average 1.25) internal successors, (370), 298 states have internal predecessors, (370), 88 states have call successors, (88), 23 states have call predecessors, (88), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-22 06:50:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 546 transitions. [2024-11-22 06:50:39,186 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 546 transitions. Word has length 88 [2024-11-22 06:50:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:39,186 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 546 transitions. [2024-11-22 06:50:39,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 546 transitions. [2024-11-22 06:50:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 06:50:39,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:39,187 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:39,199 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 (7)] Ended with exit code 0 [2024-11-22 06:50:39,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-22 06:50:39,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 06:50:39,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:39,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:39,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1462746651, now seen corresponding path program 1 times [2024-11-22 06:50:39,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:50:39,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403849683] [2024-11-22 06:50:39,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:39,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:39,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:50:39,593 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 06:50:39,593 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 (9)] Waiting until timeout for monitored process [2024-11-22 06:50:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:39,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 06:50:39,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-22 06:50:40,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 06:50:40,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 06:50:40,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403849683] [2024-11-22 06:50:40,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403849683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 06:50:40,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1323617222] [2024-11-22 06:50:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:40,290 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 06:50:40,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 06:50:40,291 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 06:50:40,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-22 06:50:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:40,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 06:50:40,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 06:50:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-22 06:50:41,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 06:50:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1323617222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 06:50:41,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 06:50:41,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-22 06:50:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052459907] [2024-11-22 06:50:41,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 06:50:41,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 06:50:41,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 06:50:41,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 06:50:41,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-22 06:50:41,020 INFO L87 Difference]: Start difference. First operand 408 states and 546 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 06:50:42,145 INFO L93 Difference]: Finished difference Result 714 states and 956 transitions. [2024-11-22 06:50:42,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 06:50:42,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-11-22 06:50:42,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 06:50:42,154 INFO L225 Difference]: With dead ends: 714 [2024-11-22 06:50:42,154 INFO L226 Difference]: Without dead ends: 553 [2024-11-22 06:50:42,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-22 06:50:42,157 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 66 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 06:50:42,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 278 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 06:50:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-22 06:50:42,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 511. [2024-11-22 06:50:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 369 states have (on average 1.2439024390243902) internal successors, (459), 371 states have internal predecessors, (459), 112 states have call successors, (112), 29 states have call predecessors, (112), 29 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-22 06:50:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 683 transitions. [2024-11-22 06:50:42,202 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 683 transitions. Word has length 88 [2024-11-22 06:50:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 06:50:42,203 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 683 transitions. [2024-11-22 06:50:42,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-22 06:50:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 683 transitions. [2024-11-22 06:50:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 06:50:42,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 06:50:42,208 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 06:50:42,215 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 (9)] Ended with exit code 0 [2024-11-22 06:50:42,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-22 06:50:42,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 06:50:42,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 06:50:42,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 06:50:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1226323989, now seen corresponding path program 1 times [2024-11-22 06:50:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 06:50:42,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423116295] [2024-11-22 06:50:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 06:50:42,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 06:50:42,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 06:50:42,612 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 06:50:42,613 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 (11)] Waiting until timeout for monitored process [2024-11-22 06:50:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 06:50:42,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 06:50:42,725 INFO L278 TraceCheckSpWp]: Computing forward predicates...