./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.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 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:56:28,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:56:28,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:56:28,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:56:28,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:56:28,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:56:28,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:56:28,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:56:28,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:56:28,802 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:56:28,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:56:28,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:56:28,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:56:28,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:56:28,805 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:56:28,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:56:28,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:56:28,806 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:56:28,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:56:28,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:56:28,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:56:28,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:56:28,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:56:28,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:56:28,812 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:56:28,812 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:56:28,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:56:28,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:56:28,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:56:28,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:56:28,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:56:28,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:56:28,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:56:28,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:56:28,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:56:28,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:56:28,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:56:28,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:56:28,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:56:28,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:56:28,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:56:28,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:56:28,817 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 -> 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd [2024-10-24 08:56:29,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:56:29,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:56:29,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:56:29,086 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:56:29,087 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:56:29,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2024-10-24 08:56:30,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:56:30,679 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:56:30,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2024-10-24 08:56:30,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14aa26222/919378cb2ef54665bee08e3c40555a73/FLAG18fe4b82b [2024-10-24 08:56:30,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14aa26222/919378cb2ef54665bee08e3c40555a73 [2024-10-24 08:56:30,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:56:30,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:56:30,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:56:30,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:56:30,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:56:30,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:30,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0c32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30, skipping insertion in model container [2024-10-24 08:56:30,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:30,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:56:30,897 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2024-10-24 08:56:30,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:56:30,940 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:56:30,951 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2024-10-24 08:56:30,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:56:30,998 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:56:30,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30 WrapperNode [2024-10-24 08:56:31,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:56:31,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:56:31,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:56:31,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:56:31,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,046 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-10-24 08:56:31,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:56:31,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:56:31,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:56:31,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:56:31,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,075 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:56:31,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:56:31,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:56:31,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:56:31,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:56:31,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (1/1) ... [2024-10-24 08:56:31,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:56:31,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:56:31,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:56:31,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:56:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:56:31,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:56:31,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:56:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:56:31,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:56:31,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:56:31,267 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:56:31,269 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:56:31,551 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-24 08:56:31,551 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:56:31,595 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:56:31,595 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:56:31,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:31 BoogieIcfgContainer [2024-10-24 08:56:31,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:56:31,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:56:31,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:56:31,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:56:31,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:56:30" (1/3) ... [2024-10-24 08:56:31,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207919a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:56:31, skipping insertion in model container [2024-10-24 08:56:31,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:30" (2/3) ... [2024-10-24 08:56:31,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207919a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:56:31, skipping insertion in model container [2024-10-24 08:56:31,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:31" (3/3) ... [2024-10-24 08:56:31,612 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-55.i [2024-10-24 08:56:31,630 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:56:31,631 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:56:31,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:56:31,707 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;@5699602e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:56:31,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:56:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 42 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:56:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 08:56:31,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:31,726 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:31,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:31,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash -369930978, now seen corresponding path program 1 times [2024-10-24 08:56:31,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:31,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778668152] [2024-10-24 08:56:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:31,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:32,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:32,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778668152] [2024-10-24 08:56:32,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778668152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:32,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:32,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:56:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140402593] [2024-10-24 08:56:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:32,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:56:32,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:32,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:56:32,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:56:32,177 INFO L87 Difference]: Start difference. First operand has 60 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 42 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 08:56:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:32,219 INFO L93 Difference]: Finished difference Result 117 states and 196 transitions. [2024-10-24 08:56:32,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:56:32,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-10-24 08:56:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:32,233 INFO L225 Difference]: With dead ends: 117 [2024-10-24 08:56:32,233 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 08:56:32,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:56:32,240 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:32,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:56:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 08:56:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-24 08:56:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:56:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-10-24 08:56:32,288 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 102 [2024-10-24 08:56:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:32,288 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-10-24 08:56:32,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 08:56:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-10-24 08:56:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 08:56:32,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:32,293 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:32,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:56:32,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:32,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:32,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1880068834, now seen corresponding path program 1 times [2024-10-24 08:56:32,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:32,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556141790] [2024-10-24 08:56:32,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:32,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:32,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556141790] [2024-10-24 08:56:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556141790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:56:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486198588] [2024-10-24 08:56:32,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:32,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:56:32,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:32,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:56:32,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:32,541 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:32,589 INFO L93 Difference]: Finished difference Result 141 states and 207 transitions. [2024-10-24 08:56:32,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:56:32,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2024-10-24 08:56:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:32,593 INFO L225 Difference]: With dead ends: 141 [2024-10-24 08:56:32,594 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 08:56:32,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:32,597 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:32,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:56:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 08:56:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 59. [2024-10-24 08:56:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:56:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-10-24 08:56:32,616 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 102 [2024-10-24 08:56:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:32,618 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-10-24 08:56:32,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-10-24 08:56:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 08:56:32,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:32,621 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:32,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:56:32,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:32,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1179004256, now seen corresponding path program 1 times [2024-10-24 08:56:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:32,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113111594] [2024-10-24 08:56:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:32,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:32,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113111594] [2024-10-24 08:56:32,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113111594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:32,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:32,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:56:32,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561287731] [2024-10-24 08:56:32,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:32,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:56:32,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:32,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:56:32,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:32,858 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:32,922 INFO L93 Difference]: Finished difference Result 117 states and 173 transitions. [2024-10-24 08:56:32,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:56:32,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2024-10-24 08:56:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:32,926 INFO L225 Difference]: With dead ends: 117 [2024-10-24 08:56:32,926 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 08:56:32,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:32,929 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:32,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:56:32,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 08:56:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-24 08:56:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:56:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-10-24 08:56:32,937 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 102 [2024-10-24 08:56:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:32,938 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-10-24 08:56:32,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-10-24 08:56:32,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 08:56:32,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:32,942 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:32,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:56:32,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:32,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:32,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1957507525, now seen corresponding path program 1 times [2024-10-24 08:56:32,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:32,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043428496] [2024-10-24 08:56:32,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:32,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:33,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:33,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043428496] [2024-10-24 08:56:33,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043428496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:33,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:33,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:56:33,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141664556] [2024-10-24 08:56:33,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:33,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:56:33,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:33,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:56:33,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:56:33,853 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:34,003 INFO L93 Difference]: Finished difference Result 143 states and 205 transitions. [2024-10-24 08:56:34,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:56:34,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-10-24 08:56:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:34,009 INFO L225 Difference]: With dead ends: 143 [2024-10-24 08:56:34,009 INFO L226 Difference]: Without dead ends: 85 [2024-10-24 08:56:34,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:56:34,011 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 26 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:34,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 255 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:56:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-24 08:56:34,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2024-10-24 08:56:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:56:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2024-10-24 08:56:34,039 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 104 [2024-10-24 08:56:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:34,041 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2024-10-24 08:56:34,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2024-10-24 08:56:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 08:56:34,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:34,046 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:34,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:56:34,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:34,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:34,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1238678057, now seen corresponding path program 1 times [2024-10-24 08:56:34,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:34,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402956253] [2024-10-24 08:56:34,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:34,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:34,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:34,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402956253] [2024-10-24 08:56:34,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402956253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:34,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:34,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:56:34,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006410730] [2024-10-24 08:56:34,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:34,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:56:34,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:34,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:56:34,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:34,245 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:34,311 INFO L93 Difference]: Finished difference Result 198 states and 287 transitions. [2024-10-24 08:56:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:56:34,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-24 08:56:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:34,314 INFO L225 Difference]: With dead ends: 198 [2024-10-24 08:56:34,315 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 08:56:34,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:34,316 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 48 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:34,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 163 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:56:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 08:56:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2024-10-24 08:56:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 08:56:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 179 transitions. [2024-10-24 08:56:34,351 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 179 transitions. Word has length 105 [2024-10-24 08:56:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:34,352 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 179 transitions. [2024-10-24 08:56:34,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 179 transitions. [2024-10-24 08:56:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 08:56:34,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:34,353 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:34,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:56:34,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:34,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash 435868846, now seen corresponding path program 1 times [2024-10-24 08:56:34,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:34,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973988065] [2024-10-24 08:56:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:34,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:34,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973988065] [2024-10-24 08:56:34,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973988065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:34,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:34,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:56:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563549723] [2024-10-24 08:56:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:34,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:56:34,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:34,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:56:34,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:56:34,531 INFO L87 Difference]: Start difference. First operand 125 states and 179 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:34,697 INFO L93 Difference]: Finished difference Result 362 states and 513 transitions. [2024-10-24 08:56:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:56:34,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-10-24 08:56:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:34,700 INFO L225 Difference]: With dead ends: 362 [2024-10-24 08:56:34,700 INFO L226 Difference]: Without dead ends: 292 [2024-10-24 08:56:34,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 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-10-24 08:56:34,702 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 142 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:34,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 311 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:56:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-24 08:56:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 247. [2024-10-24 08:56:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 178 states have internal predecessors, (227), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 08:56:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 355 transitions. [2024-10-24 08:56:34,741 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 355 transitions. Word has length 106 [2024-10-24 08:56:34,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:34,743 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 355 transitions. [2024-10-24 08:56:34,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 355 transitions. [2024-10-24 08:56:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 08:56:34,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:34,745 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:34,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 08:56:34,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:34,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:34,746 INFO L85 PathProgramCache]: Analyzing trace with hash -575248404, now seen corresponding path program 1 times [2024-10-24 08:56:34,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:34,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151235501] [2024-10-24 08:56:34,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:34,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:34,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151235501] [2024-10-24 08:56:34,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151235501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:34,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:34,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:56:34,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734468161] [2024-10-24 08:56:34,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:34,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:56:34,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:34,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:56:34,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:56:34,992 INFO L87 Difference]: Start difference. First operand 247 states and 355 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:35,149 INFO L93 Difference]: Finished difference Result 416 states and 592 transitions. [2024-10-24 08:56:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:56:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-10-24 08:56:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:35,152 INFO L225 Difference]: With dead ends: 416 [2024-10-24 08:56:35,152 INFO L226 Difference]: Without dead ends: 278 [2024-10-24 08:56:35,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 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-10-24 08:56:35,153 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 134 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:35,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 310 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:56:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-24 08:56:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 246. [2024-10-24 08:56:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 177 states have (on average 1.265536723163842) internal successors, (224), 177 states have internal predecessors, (224), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 08:56:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 352 transitions. [2024-10-24 08:56:35,176 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 352 transitions. Word has length 106 [2024-10-24 08:56:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:35,176 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 352 transitions. [2024-10-24 08:56:35,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 352 transitions. [2024-10-24 08:56:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 08:56:35,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:35,178 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:35,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 08:56:35,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:35,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:35,179 INFO L85 PathProgramCache]: Analyzing trace with hash 952158433, now seen corresponding path program 1 times [2024-10-24 08:56:35,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:35,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480122311] [2024-10-24 08:56:35,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:35,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:35,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480122311] [2024-10-24 08:56:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480122311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:35,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:56:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516672579] [2024-10-24 08:56:35,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:35,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:56:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:56:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:35,288 INFO L87 Difference]: Start difference. First operand 246 states and 352 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:35,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:35,334 INFO L93 Difference]: Finished difference Result 491 states and 703 transitions. [2024-10-24 08:56:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:56:35,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-24 08:56:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:35,336 INFO L225 Difference]: With dead ends: 491 [2024-10-24 08:56:35,336 INFO L226 Difference]: Without dead ends: 246 [2024-10-24 08:56:35,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:35,338 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:35,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:56:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-24 08:56:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-24 08:56:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 177 states have (on average 1.2429378531073447) internal successors, (220), 177 states have internal predecessors, (220), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 08:56:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 348 transitions. [2024-10-24 08:56:35,367 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 348 transitions. Word has length 107 [2024-10-24 08:56:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:35,367 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 348 transitions. [2024-10-24 08:56:35,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 348 transitions. [2024-10-24 08:56:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 08:56:35,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:35,369 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:35,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 08:56:35,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:35,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2064681125, now seen corresponding path program 1 times [2024-10-24 08:56:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:35,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058187779] [2024-10-24 08:56:35,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:35,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:35,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:35,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058187779] [2024-10-24 08:56:35,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058187779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:35,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:35,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:56:35,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228646963] [2024-10-24 08:56:35,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:35,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:56:35,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:35,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:56:35,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:56:35,782 INFO L87 Difference]: Start difference. First operand 246 states and 348 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:36,044 INFO L93 Difference]: Finished difference Result 550 states and 762 transitions. [2024-10-24 08:56:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 08:56:36,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-24 08:56:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:36,047 INFO L225 Difference]: With dead ends: 550 [2024-10-24 08:56:36,047 INFO L226 Difference]: Without dead ends: 305 [2024-10-24 08:56:36,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-24 08:56:36,049 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 126 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:36,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 550 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:56:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-24 08:56:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 236. [2024-10-24 08:56:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 167 states have (on average 1.2095808383233533) internal successors, (202), 167 states have internal predecessors, (202), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 08:56:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 330 transitions. [2024-10-24 08:56:36,069 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 330 transitions. Word has length 107 [2024-10-24 08:56:36,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:36,070 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 330 transitions. [2024-10-24 08:56:36,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 330 transitions. [2024-10-24 08:56:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 08:56:36,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:36,071 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:36,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 08:56:36,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:36,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:36,072 INFO L85 PathProgramCache]: Analyzing trace with hash -415092196, now seen corresponding path program 1 times [2024-10-24 08:56:36,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:36,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500099962] [2024-10-24 08:56:36,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:36,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:36,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:36,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500099962] [2024-10-24 08:56:36,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500099962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:36,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:36,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:56:36,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975205294] [2024-10-24 08:56:36,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:36,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:56:36,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:36,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:56:36,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:56:36,338 INFO L87 Difference]: Start difference. First operand 236 states and 330 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:36,569 INFO L93 Difference]: Finished difference Result 500 states and 681 transitions. [2024-10-24 08:56:36,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 08:56:36,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-10-24 08:56:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:36,572 INFO L225 Difference]: With dead ends: 500 [2024-10-24 08:56:36,572 INFO L226 Difference]: Without dead ends: 365 [2024-10-24 08:56:36,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 08:56:36,573 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 112 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:36,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 348 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:56:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-24 08:56:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2024-10-24 08:56:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 201 states have (on average 1.199004975124378) internal successors, (241), 201 states have internal predecessors, (241), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 08:56:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 401 transitions. [2024-10-24 08:56:36,600 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 401 transitions. Word has length 109 [2024-10-24 08:56:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:36,600 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 401 transitions. [2024-10-24 08:56:36,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 401 transitions. [2024-10-24 08:56:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 08:56:36,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:36,602 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:36,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 08:56:36,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:36,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash -729717096, now seen corresponding path program 1 times [2024-10-24 08:56:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:36,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844989295] [2024-10-24 08:56:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:36,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:36,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844989295] [2024-10-24 08:56:36,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844989295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:36,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:36,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:56:36,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809350497] [2024-10-24 08:56:36,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:36,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:56:36,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:56:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:36,669 INFO L87 Difference]: Start difference. First operand 287 states and 401 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:36,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:36,737 INFO L93 Difference]: Finished difference Result 523 states and 742 transitions. [2024-10-24 08:56:36,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:56:36,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-10-24 08:56:36,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:36,741 INFO L225 Difference]: With dead ends: 523 [2024-10-24 08:56:36,741 INFO L226 Difference]: Without dead ends: 394 [2024-10-24 08:56:36,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:36,742 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:36,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 135 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:56:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-24 08:56:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 265. [2024-10-24 08:56:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 179 states have (on average 1.2122905027932962) internal successors, (217), 179 states have internal predecessors, (217), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 08:56:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 377 transitions. [2024-10-24 08:56:36,775 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 377 transitions. Word has length 111 [2024-10-24 08:56:36,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:36,775 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 377 transitions. [2024-10-24 08:56:36,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 377 transitions. [2024-10-24 08:56:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 08:56:36,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:36,777 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:36,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 08:56:36,777 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:36,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:36,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1822033492, now seen corresponding path program 1 times [2024-10-24 08:56:36,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:36,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230786157] [2024-10-24 08:56:36,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:36,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-24 08:56:38,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:38,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230786157] [2024-10-24 08:56:38,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230786157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:56:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427361465] [2024-10-24 08:56:38,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:38,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:56:38,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:56:38,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:56:38,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:56:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:38,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 08:56:38,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:56:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 171 proven. 51 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-10-24 08:56:39,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:56:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-24 08:56:40,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427361465] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:56:40,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:56:40,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2024-10-24 08:56:40,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496018383] [2024-10-24 08:56:40,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:56:40,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 08:56:40,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:40,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 08:56:40,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2024-10-24 08:56:40,453 INFO L87 Difference]: Start difference. First operand 265 states and 377 transitions. Second operand has 28 states, 28 states have (on average 3.607142857142857) internal successors, (101), 28 states have internal predecessors, (101), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (37), 5 states have call predecessors, (37), 5 states have call successors, (37) [2024-10-24 08:56:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:42,752 INFO L93 Difference]: Finished difference Result 493 states and 613 transitions. [2024-10-24 08:56:42,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-24 08:56:42,753 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.607142857142857) internal successors, (101), 28 states have internal predecessors, (101), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (37), 5 states have call predecessors, (37), 5 states have call successors, (37) Word has length 113 [2024-10-24 08:56:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:42,756 INFO L225 Difference]: With dead ends: 493 [2024-10-24 08:56:42,756 INFO L226 Difference]: Without dead ends: 491 [2024-10-24 08:56:42,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=822, Invalid=3870, Unknown=0, NotChecked=0, Total=4692 [2024-10-24 08:56:42,758 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 701 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:42,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 527 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 08:56:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-10-24 08:56:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 329. [2024-10-24 08:56:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 233 states have (on average 1.1802575107296138) internal successors, (275), 233 states have internal predecessors, (275), 80 states have call successors, (80), 15 states have call predecessors, (80), 15 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 08:56:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 435 transitions. [2024-10-24 08:56:42,793 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 435 transitions. Word has length 113 [2024-10-24 08:56:42,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:42,794 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 435 transitions. [2024-10-24 08:56:42,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.607142857142857) internal successors, (101), 28 states have internal predecessors, (101), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (37), 5 states have call predecessors, (37), 5 states have call successors, (37) [2024-10-24 08:56:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2024-10-24 08:56:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 08:56:42,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:42,796 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:42,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 08:56:42,997 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,SelfDestructingSolverStorable11 [2024-10-24 08:56:42,998 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:42,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:42,999 INFO L85 PathProgramCache]: Analyzing trace with hash 221157143, now seen corresponding path program 1 times [2024-10-24 08:56:42,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:42,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798956036] [2024-10-24 08:56:42,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:42,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:56:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:56:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:56:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:56:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:56:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:56:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:56:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:56:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:56:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:56:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:56:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:56:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:56:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:56:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:56:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:56:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-24 08:56:43,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:56:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798956036] [2024-10-24 08:56:43,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798956036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:56:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648240223] [2024-10-24 08:56:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:43,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:56:43,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:56:43,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:56:43,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 08:56:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:43,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 08:56:43,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:56:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-24 08:56:43,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:56:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-24 08:56:43,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648240223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:56:43,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:56:43,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-10-24 08:56:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520827325] [2024-10-24 08:56:43,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:56:43,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 08:56:43,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:56:43,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 08:56:43,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-24 08:56:43,608 INFO L87 Difference]: Start difference. First operand 329 states and 435 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-10-24 08:56:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:43,944 INFO L93 Difference]: Finished difference Result 530 states and 688 transitions. [2024-10-24 08:56:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 08:56:43,944 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 114 [2024-10-24 08:56:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:43,947 INFO L225 Difference]: With dead ends: 530 [2024-10-24 08:56:43,947 INFO L226 Difference]: Without dead ends: 362 [2024-10-24 08:56:43,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2024-10-24 08:56:43,948 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 93 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:43,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 227 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:56:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-24 08:56:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 337. [2024-10-24 08:56:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 239 states have (on average 1.1506276150627615) internal successors, (275), 239 states have internal predecessors, (275), 80 states have call successors, (80), 17 states have call predecessors, (80), 17 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 08:56:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 435 transitions. [2024-10-24 08:56:43,979 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 435 transitions. Word has length 114 [2024-10-24 08:56:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:43,979 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 435 transitions. [2024-10-24 08:56:43,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-10-24 08:56:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 435 transitions. [2024-10-24 08:56:43,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 08:56:43,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:43,981 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:43,999 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-10-24 08:56:44,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-24 08:56:44,186 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:44,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash -365648871, now seen corresponding path program 1 times [2024-10-24 08:56:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:56:44,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892826226] [2024-10-24 08:56:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:44,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:56:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:56:44,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:56:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:56:44,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:56:44,291 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:56:44,292 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:56:44,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 08:56:44,298 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:44,386 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:56:44,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:56:44 BoogieIcfgContainer [2024-10-24 08:56:44,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:56:44,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:56:44,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:56:44,391 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:56:44,391 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:31" (3/4) ... [2024-10-24 08:56:44,393 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:56:44,394 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:56:44,395 INFO L158 Benchmark]: Toolchain (without parser) took 13688.14ms. Allocated memory was 180.4MB in the beginning and 333.4MB in the end (delta: 153.1MB). Free memory was 131.2MB in the beginning and 169.4MB in the end (delta: -38.2MB). Peak memory consumption was 116.5MB. Max. memory is 16.1GB. [2024-10-24 08:56:44,395 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:56:44,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.72ms. Allocated memory is still 180.4MB. Free memory was 130.7MB in the beginning and 116.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 08:56:44,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.48ms. Allocated memory is still 180.4MB. Free memory was 116.6MB in the beginning and 114.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:56:44,396 INFO L158 Benchmark]: Boogie Preprocessor took 51.69ms. Allocated memory is still 180.4MB. Free memory was 114.0MB in the beginning and 110.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:56:44,397 INFO L158 Benchmark]: RCFGBuilder took 496.05ms. Allocated memory is still 180.4MB. Free memory was 110.8MB in the beginning and 89.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 08:56:44,397 INFO L158 Benchmark]: TraceAbstraction took 12788.19ms. Allocated memory was 180.4MB in the beginning and 333.4MB in the end (delta: 153.1MB). Free memory was 89.3MB in the beginning and 170.4MB in the end (delta: -81.1MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2024-10-24 08:56:44,397 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 333.4MB. Free memory was 170.4MB in the beginning and 169.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:56:44,399 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.17ms. Allocated memory is still 180.4MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.72ms. Allocated memory is still 180.4MB. Free memory was 130.7MB in the beginning and 116.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.48ms. Allocated memory is still 180.4MB. Free memory was 116.6MB in the beginning and 114.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.69ms. Allocated memory is still 180.4MB. Free memory was 114.0MB in the beginning and 110.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 496.05ms. Allocated memory is still 180.4MB. Free memory was 110.8MB in the beginning and 89.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12788.19ms. Allocated memory was 180.4MB in the beginning and 333.4MB in the end (delta: 153.1MB). Free memory was 89.3MB in the beginning and 170.4MB in the end (delta: -81.1MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 333.4MB. Free memory was 170.4MB in the beginning and 169.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_7 = 256; [L26] signed long int var_1_8 = 63; [L27] signed long int var_1_9 = 1; [L28] signed long int var_1_10 = 0; [L29] signed long int var_1_11 = 16; [L30] signed long int var_1_12 = -5; [L31] unsigned char var_1_14 = 128; [L32] signed long int var_1_15 = 4; [L33] unsigned long int var_1_16 = 500; [L34] unsigned char var_1_17 = 2; [L35] unsigned char var_1_18 = 100; [L36] signed long int last_1_var_1_12 = -5; [L37] unsigned char last_1_var_1_17 = 2; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_12 = var_1_12 [L98] last_1_var_1_17 = var_1_17 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L77] var_1_8 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L80] var_1_9 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L83] var_1_10 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L86] var_1_11 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L92] var_1_18 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L109] RET updateVariables() [L110] CALL step() [L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L42] signed long int stepLocal_0 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L43] COND FALSE !(\read(var_1_2)) [L52] var_1_1 = last_1_var_1_17 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L54] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L57] var_1_15 = var_1_8 [L58] var_1_16 = var_1_14 [L59] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)); [L61] signed long int stepLocal_2 = var_1_1 / -8; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-255, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L62] COND TRUE (~ var_1_17) <= stepLocal_3 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L63] COND FALSE !((var_1_14 - 64) < stepLocal_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101-L102] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((signed long int) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=-2, var_1_18=-2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1526 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1482 mSDsluCounter, 3353 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2286 mSDsCounter, 561 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1806 IncrementalHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 561 mSolverCounterUnsat, 1067 mSDtfsCounter, 1806 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1020 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=337occurred in iteration=13, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 582 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1729 NumberOfCodeBlocks, 1729 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1825 ConstructedInterpolants, 0 QuantifiedInterpolants, 5713 SizeOfPredicates, 13 NumberOfNonLiveVariables, 523 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 8064/8160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 08:56:44,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.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 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:56:46,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:56:46,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:56:46,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:56:46,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:56:46,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:56:46,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:56:46,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:56:46,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:56:46,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:56:46,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:56:46,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:56:46,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:56:46,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:56:46,794 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:56:46,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:56:46,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:56:46,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:56:46,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:56:46,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:56:46,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:56:46,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:56:46,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:56:46,799 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:56:46,799 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:56:46,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:56:46,800 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:56:46,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:56:46,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:56:46,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:56:46,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:56:46,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:56:46,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:56:46,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:56:46,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:56:46,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:56:46,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:56:46,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:56:46,803 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:56:46,803 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:56:46,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:56:46,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:56:46,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:56:46,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:56:46,804 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:56:46,805 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 -> 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd [2024-10-24 08:56:47,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:56:47,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:56:47,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:56:47,184 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:56:47,185 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:56:47,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2024-10-24 08:56:48,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:56:48,995 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:56:48,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2024-10-24 08:56:49,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1044caa9/f9dd7a5b75754521aa14b1d305151dc7/FLAG20e039b4c [2024-10-24 08:56:49,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1044caa9/f9dd7a5b75754521aa14b1d305151dc7 [2024-10-24 08:56:49,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:56:49,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:56:49,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:56:49,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:56:49,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:56:49,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308016eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49, skipping insertion in model container [2024-10-24 08:56:49,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:56:49,270 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2024-10-24 08:56:49,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:56:49,330 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:56:49,344 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2024-10-24 08:56:49,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:56:49,400 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:56:49,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49 WrapperNode [2024-10-24 08:56:49,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:56:49,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:56:49,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:56:49,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:56:49,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,454 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-10-24 08:56:49,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:56:49,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:56:49,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:56:49,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:56:49,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,493 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:56:49,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:56:49,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:56:49,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:56:49,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:56:49,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (1/1) ... [2024-10-24 08:56:49,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:56:49,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:56:49,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:56:49,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:56:49,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:56:49,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:56:49,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:56:49,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:56:49,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:56:49,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:56:49,671 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:56:49,673 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:56:49,933 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 08:56:49,933 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:56:50,010 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:56:50,010 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:56:50,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:50 BoogieIcfgContainer [2024-10-24 08:56:50,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:56:50,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:56:50,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:56:50,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:56:50,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:56:49" (1/3) ... [2024-10-24 08:56:50,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623ed87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:56:50, skipping insertion in model container [2024-10-24 08:56:50,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:56:49" (2/3) ... [2024-10-24 08:56:50,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623ed87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:56:50, skipping insertion in model container [2024-10-24 08:56:50,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:56:50" (3/3) ... [2024-10-24 08:56:50,028 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-55.i [2024-10-24 08:56:50,044 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:56:50,044 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:56:50,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:56:50,117 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;@141546e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:56:50,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:56:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:56:50,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 08:56:50,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:50,138 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:50,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:50,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1570447154, now seen corresponding path program 1 times [2024-10-24 08:56:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:56:50,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836750552] [2024-10-24 08:56:50,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:50,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:56:50,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:56:50,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:56:50,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 08:56:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:50,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:56:50,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:56:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-24 08:56:50,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:56:50,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:56:50,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836750552] [2024-10-24 08:56:50,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836750552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:50,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:50,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:56:50,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461087889] [2024-10-24 08:56:50,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:50,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:56:50,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:56:50,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:56:50,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:56:50,445 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:50,487 INFO L93 Difference]: Finished difference Result 85 states and 150 transitions. [2024-10-24 08:56:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:56:50,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 97 [2024-10-24 08:56:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:50,498 INFO L225 Difference]: With dead ends: 85 [2024-10-24 08:56:50,498 INFO L226 Difference]: Without dead ends: 42 [2024-10-24 08:56:50,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:56:50,506 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:50,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:56:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-24 08:56:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-24 08:56:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:56:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 63 transitions. [2024-10-24 08:56:50,550 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 63 transitions. Word has length 97 [2024-10-24 08:56:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:50,550 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 63 transitions. [2024-10-24 08:56:50,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:50,551 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 63 transitions. [2024-10-24 08:56:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 08:56:50,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:50,555 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:50,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 08:56:50,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:56:50,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:50,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:50,759 INFO L85 PathProgramCache]: Analyzing trace with hash -169214158, now seen corresponding path program 1 times [2024-10-24 08:56:50,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:56:50,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612993866] [2024-10-24 08:56:50,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:50,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:56:50,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:56:50,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:56:50,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 08:56:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:50,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 08:56:50,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:56:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 08:56:50,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:56:50,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:56:50,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612993866] [2024-10-24 08:56:50,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612993866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:56:50,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:56:50,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:56:50,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713179584] [2024-10-24 08:56:50,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:56:50,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:56:50,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:56:50,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:56:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:50,883 INFO L87 Difference]: Start difference. First operand 42 states and 63 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:56:50,945 INFO L93 Difference]: Finished difference Result 93 states and 138 transitions. [2024-10-24 08:56:50,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:56:50,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 97 [2024-10-24 08:56:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:56:50,948 INFO L225 Difference]: With dead ends: 93 [2024-10-24 08:56:50,948 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 08:56:50,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:56:50,950 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:56:50,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:56:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 08:56:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2024-10-24 08:56:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 08:56:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2024-10-24 08:56:50,960 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 97 [2024-10-24 08:56:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:56:50,962 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2024-10-24 08:56:50,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 08:56:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2024-10-24 08:56:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 08:56:50,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:56:50,965 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:56:50,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 08:56:51,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:56:51,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:56:51,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:56:51,172 INFO L85 PathProgramCache]: Analyzing trace with hash -111955856, now seen corresponding path program 1 times [2024-10-24 08:56:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:56:51,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808742349] [2024-10-24 08:56:51,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:56:51,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:56:51,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:56:51,177 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:56:51,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 08:56:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:56:51,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 08:56:51,309 INFO L278 TraceCheckSpWp]: Computing forward predicates...