./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.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 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:18:00,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:18:00,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:18:00,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:18:00,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:18:00,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:18:00,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:18:00,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:18:00,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:18:00,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:18:00,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:18:00,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:18:00,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:18:00,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:18:00,528 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:18:00,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:18:00,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:18:00,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:18:00,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:18:00,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:18:00,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:18:00,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:18:00,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:18:00,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:18:00,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:18:00,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:18:00,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:18:00,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:18:00,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:18:00,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:18:00,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:18:00,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:18:00,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:18:00,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:18:00,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:18:00,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:18:00,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:18:00,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:18:00,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:18:00,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:18:00,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:18:00,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:18:00,539 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 -> 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 [2024-11-18 22:18:00,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:18:00,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:18:00,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:18:00,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:18:00,824 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:18:00,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-18 22:18:02,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:18:02,427 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:18:02,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-18 22:18:02,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fe69f2aa/30fc409e01984ed1a809dd692ec8aaed/FLAG21e51dda7 [2024-11-18 22:18:02,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fe69f2aa/30fc409e01984ed1a809dd692ec8aaed [2024-11-18 22:18:02,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:18:02,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:18:02,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:18:02,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:18:02,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:18:02,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:18:02" (1/1) ... [2024-11-18 22:18:02,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f606d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:02, skipping insertion in model container [2024-11-18 22:18:02,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:18:02" (1/1) ... [2024-11-18 22:18:02,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:18:02,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i[916,929] [2024-11-18 22:18:03,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:18:03,047 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:18:03,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i[916,929] [2024-11-18 22:18:03,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:18:03,104 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:18:03,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03 WrapperNode [2024-11-18 22:18:03,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:18:03,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:18:03,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:18:03,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:18:03,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,147 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-11-18 22:18:03,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:18:03,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:18:03,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:18:03,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:18:03,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,184 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:18:03,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:18:03,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:18:03,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:18:03,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:18:03,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (1/1) ... [2024-11-18 22:18:03,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:18:03,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:03,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 22:18:03,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 22:18:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:18:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:18:03,287 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:18:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:18:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:18:03,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:18:03,356 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:18:03,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:18:03,655 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-18 22:18:03,656 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:18:03,668 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:18:03,668 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:18:03,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:03 BoogieIcfgContainer [2024-11-18 22:18:03,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:18:03,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:18:03,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:18:03,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:18:03,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:18:02" (1/3) ... [2024-11-18 22:18:03,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b6c5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:18:03, skipping insertion in model container [2024-11-18 22:18:03,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:03" (2/3) ... [2024-11-18 22:18:03,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b6c5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:18:03, skipping insertion in model container [2024-11-18 22:18:03,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:03" (3/3) ... [2024-11-18 22:18:03,678 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-18 22:18:03,693 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:18:03,693 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:18:03,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:18:03,755 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;@27f567fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:18:03,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:18:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:18:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-18 22:18:03,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:03,773 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:03,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:03,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:03,779 INFO L85 PathProgramCache]: Analyzing trace with hash 273559296, now seen corresponding path program 1 times [2024-11-18 22:18:03,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:03,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313177028] [2024-11-18 22:18:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:03,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-18 22:18:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313177028] [2024-11-18 22:18:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313177028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:18:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227488953] [2024-11-18 22:18:04,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:04,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:04,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:04,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:18:04,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 22:18:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:04,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:18:04,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-18 22:18:04,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:18:04,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227488953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:04,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:18:04,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:18:04,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870438165] [2024-11-18 22:18:04,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:04,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:18:04,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:04,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:18:04,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:18:04,316 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 22:18:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:04,338 INFO L93 Difference]: Finished difference Result 121 states and 206 transitions. [2024-11-18 22:18:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:18:04,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-18 22:18:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:04,345 INFO L225 Difference]: With dead ends: 121 [2024-11-18 22:18:04,345 INFO L226 Difference]: Without dead ends: 60 [2024-11-18 22:18:04,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:18:04,351 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:04,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:18:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-18 22:18:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-18 22:18:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:18:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2024-11-18 22:18:04,402 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 113 [2024-11-18 22:18:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:04,402 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2024-11-18 22:18:04,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 22:18:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2024-11-18 22:18:04,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-18 22:18:04,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:04,405 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:04,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 22:18:04,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:18:04,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:04,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1565859904, now seen corresponding path program 1 times [2024-11-18 22:18:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:04,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92370666] [2024-11-18 22:18:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 22:18:05,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:05,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92370666] [2024-11-18 22:18:05,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92370666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:05,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:05,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:18:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575877797] [2024-11-18 22:18:05,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:05,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:18:05,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:05,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:18:05,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:05,752 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:05,942 INFO L93 Difference]: Finished difference Result 136 states and 203 transitions. [2024-11-18 22:18:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:18:05,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-18 22:18:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:05,945 INFO L225 Difference]: With dead ends: 136 [2024-11-18 22:18:05,945 INFO L226 Difference]: Without dead ends: 79 [2024-11-18 22:18:05,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:18:05,947 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:05,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 221 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:18:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-18 22:18:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2024-11-18 22:18:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:18:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2024-11-18 22:18:05,959 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 113 [2024-11-18 22:18:05,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:05,961 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2024-11-18 22:18:05,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2024-11-18 22:18:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-18 22:18:05,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:05,964 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:05,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:18:05,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:05,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:05,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1869013579, now seen corresponding path program 1 times [2024-11-18 22:18:05,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:05,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549242815] [2024-11-18 22:18:05,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:05,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 22:18:06,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:06,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549242815] [2024-11-18 22:18:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549242815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:06,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:06,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 22:18:06,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257969575] [2024-11-18 22:18:06,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:06,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 22:18:06,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:06,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 22:18:06,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 22:18:06,801 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:07,388 INFO L93 Difference]: Finished difference Result 226 states and 336 transitions. [2024-11-18 22:18:07,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 22:18:07,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-18 22:18:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:07,391 INFO L225 Difference]: With dead ends: 226 [2024-11-18 22:18:07,391 INFO L226 Difference]: Without dead ends: 167 [2024-11-18 22:18:07,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-18 22:18:07,397 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 167 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:07,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 396 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 22:18:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-18 22:18:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 67. [2024-11-18 22:18:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:18:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-11-18 22:18:07,414 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 115 [2024-11-18 22:18:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:07,416 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-11-18 22:18:07,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-11-18 22:18:07,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-18 22:18:07,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:07,420 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:07,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 22:18:07,421 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:07,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2100365159, now seen corresponding path program 1 times [2024-11-18 22:18:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:07,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064811874] [2024-11-18 22:18:07,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:07,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 33 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-18 22:18:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064811874] [2024-11-18 22:18:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064811874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:18:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777167969] [2024-11-18 22:18:07,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:07,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:07,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:07,917 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:18:07,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 22:18:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:08,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 22:18:08,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 348 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-18 22:18:08,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:18:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-18 22:18:08,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777167969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:18:08,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:18:08,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-18 22:18:08,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878895708] [2024-11-18 22:18:08,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:18:08,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 22:18:08,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:08,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 22:18:08,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-18 22:18:08,599 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2024-11-18 22:18:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:09,030 INFO L93 Difference]: Finished difference Result 163 states and 237 transitions. [2024-11-18 22:18:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 22:18:09,030 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 115 [2024-11-18 22:18:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:09,032 INFO L225 Difference]: With dead ends: 163 [2024-11-18 22:18:09,032 INFO L226 Difference]: Without dead ends: 99 [2024-11-18 22:18:09,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2024-11-18 22:18:09,035 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 140 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:09,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 231 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 22:18:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-18 22:18:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2024-11-18 22:18:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-18 22:18:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-11-18 22:18:09,061 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 115 [2024-11-18 22:18:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:09,062 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-11-18 22:18:09,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2024-11-18 22:18:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-11-18 22:18:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-18 22:18:09,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:09,063 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:09,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 22:18:09,267 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,SelfDestructingSolverStorable3 [2024-11-18 22:18:09,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:09,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1316545057, now seen corresponding path program 1 times [2024-11-18 22:18:09,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:09,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655615930] [2024-11-18 22:18:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 33 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-18 22:18:10,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:10,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655615930] [2024-11-18 22:18:10,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655615930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:18:10,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059048520] [2024-11-18 22:18:10,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:10,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:10,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:10,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:18:10,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 22:18:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:10,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-18 22:18:10,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 408 proven. 72 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-18 22:18:12,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:18:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 102 proven. 42 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-18 22:18:14,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059048520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:18:14,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:18:14,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 19] total 45 [2024-11-18 22:18:14,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633335054] [2024-11-18 22:18:14,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:18:14,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-18 22:18:14,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:14,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-18 22:18:14,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1545, Unknown=0, NotChecked=0, Total=1980 [2024-11-18 22:18:14,351 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 45 states have internal predecessors, (95), 10 states have call successors, (41), 5 states have call predecessors, (41), 12 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) [2024-11-18 22:18:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:16,227 INFO L93 Difference]: Finished difference Result 162 states and 205 transitions. [2024-11-18 22:18:16,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-18 22:18:16,229 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 45 states have internal predecessors, (95), 10 states have call successors, (41), 5 states have call predecessors, (41), 12 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) Word has length 116 [2024-11-18 22:18:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:16,231 INFO L225 Difference]: With dead ends: 162 [2024-11-18 22:18:16,231 INFO L226 Difference]: Without dead ends: 160 [2024-11-18 22:18:16,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1121, Invalid=3709, Unknown=0, NotChecked=0, Total=4830 [2024-11-18 22:18:16,234 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 468 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:16,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 510 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-18 22:18:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-18 22:18:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2024-11-18 22:18:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.153061224489796) internal successors, (113), 100 states have internal predecessors, (113), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-18 22:18:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 189 transitions. [2024-11-18 22:18:16,262 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 189 transitions. Word has length 116 [2024-11-18 22:18:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:16,262 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 189 transitions. [2024-11-18 22:18:16,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 45 states have internal predecessors, (95), 10 states have call successors, (41), 5 states have call predecessors, (41), 12 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) [2024-11-18 22:18:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 189 transitions. [2024-11-18 22:18:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-18 22:18:16,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:16,264 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:16,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 22:18:16,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:16,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:16,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1231369325, now seen corresponding path program 1 times [2024-11-18 22:18:16,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:16,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552686690] [2024-11-18 22:18:16,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:16,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 22:18:16,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552686690] [2024-11-18 22:18:16,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552686690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:16,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:16,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:18:16,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699503085] [2024-11-18 22:18:16,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:16,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:18:16,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:18:16,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:18:16,528 INFO L87 Difference]: Start difference. First operand 147 states and 189 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:16,569 INFO L93 Difference]: Finished difference Result 272 states and 344 transitions. [2024-11-18 22:18:16,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:18:16,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-18 22:18:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:16,573 INFO L225 Difference]: With dead ends: 272 [2024-11-18 22:18:16,573 INFO L226 Difference]: Without dead ends: 148 [2024-11-18 22:18:16,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:18:16,577 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 11 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:16,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 158 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:18:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-18 22:18:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2024-11-18 22:18:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 92 states have internal predecessors, (101), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-18 22:18:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 177 transitions. [2024-11-18 22:18:16,607 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 177 transitions. Word has length 118 [2024-11-18 22:18:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:16,608 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 177 transitions. [2024-11-18 22:18:16,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2024-11-18 22:18:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-18 22:18:16,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:16,610 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:16,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 22:18:16,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:16,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash 990142997, now seen corresponding path program 1 times [2024-11-18 22:18:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:16,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928997860] [2024-11-18 22:18:16,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 22:18:16,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:16,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928997860] [2024-11-18 22:18:16,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928997860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:16,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:16,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:18:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12145615] [2024-11-18 22:18:16,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:16,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:18:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:16,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:18:16,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:16,678 INFO L87 Difference]: Start difference. First operand 139 states and 177 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 22:18:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:16,778 INFO L93 Difference]: Finished difference Result 255 states and 322 transitions. [2024-11-18 22:18:16,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:18:16,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2024-11-18 22:18:16,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:16,781 INFO L225 Difference]: With dead ends: 255 [2024-11-18 22:18:16,781 INFO L226 Difference]: Without dead ends: 139 [2024-11-18 22:18:16,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:18:16,782 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:16,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 65 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:18:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-18 22:18:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-18 22:18:16,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.1) internal successors, (99), 92 states have internal predecessors, (99), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-18 22:18:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 175 transitions. [2024-11-18 22:18:16,816 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 175 transitions. Word has length 118 [2024-11-18 22:18:16,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:16,816 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 175 transitions. [2024-11-18 22:18:16,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 22:18:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 175 transitions. [2024-11-18 22:18:16,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-18 22:18:16,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:16,818 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:16,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 22:18:16,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:16,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:16,819 INFO L85 PathProgramCache]: Analyzing trace with hash -477987345, now seen corresponding path program 1 times [2024-11-18 22:18:16,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:16,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437337404] [2024-11-18 22:18:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 22:18:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:16,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437337404] [2024-11-18 22:18:16,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437337404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:16,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:16,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:18:16,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893543532] [2024-11-18 22:18:16,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:16,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:18:16,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:16,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:18:16,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:16,889 INFO L87 Difference]: Start difference. First operand 139 states and 175 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:17,072 INFO L93 Difference]: Finished difference Result 404 states and 502 transitions. [2024-11-18 22:18:17,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:18:17,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-18 22:18:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:17,075 INFO L225 Difference]: With dead ends: 404 [2024-11-18 22:18:17,075 INFO L226 Difference]: Without dead ends: 288 [2024-11-18 22:18:17,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:18:17,077 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 84 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:17,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 260 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:18:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-18 22:18:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 274. [2024-11-18 22:18:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 180 states have (on average 1.1166666666666667) internal successors, (201), 183 states have internal predecessors, (201), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-18 22:18:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 345 transitions. [2024-11-18 22:18:17,119 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 345 transitions. Word has length 119 [2024-11-18 22:18:17,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:17,120 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 345 transitions. [2024-11-18 22:18:17,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 345 transitions. [2024-11-18 22:18:17,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-18 22:18:17,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:17,121 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:17,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 22:18:17,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:17,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:17,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1641860466, now seen corresponding path program 1 times [2024-11-18 22:18:17,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:17,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218492479] [2024-11-18 22:18:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:17,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 22:18:17,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:17,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218492479] [2024-11-18 22:18:17,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218492479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:17,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:17,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:18:17,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730327162] [2024-11-18 22:18:17,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:17,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:18:17,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:17,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:18:17,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:18:17,168 INFO L87 Difference]: Start difference. First operand 274 states and 345 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:17,222 INFO L93 Difference]: Finished difference Result 525 states and 658 transitions. [2024-11-18 22:18:17,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:18:17,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-18 22:18:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:17,225 INFO L225 Difference]: With dead ends: 525 [2024-11-18 22:18:17,225 INFO L226 Difference]: Without dead ends: 274 [2024-11-18 22:18:17,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:18:17,226 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:17,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 147 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:18:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-18 22:18:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-18 22:18:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 180 states have (on average 1.1) internal successors, (198), 183 states have internal predecessors, (198), 72 states have call successors, (72), 21 states have call predecessors, (72), 21 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-18 22:18:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2024-11-18 22:18:17,263 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 120 [2024-11-18 22:18:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:17,264 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2024-11-18 22:18:17,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2024-11-18 22:18:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-18 22:18:17,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:17,265 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:17,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 22:18:17,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:17,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:17,266 INFO L85 PathProgramCache]: Analyzing trace with hash 599365845, now seen corresponding path program 1 times [2024-11-18 22:18:17,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:17,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968476830] [2024-11-18 22:18:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 22:18:17,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:17,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968476830] [2024-11-18 22:18:17,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968476830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:17,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:17,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:18:17,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755789166] [2024-11-18 22:18:17,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:17,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:18:17,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:17,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:18:17,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:18:17,302 INFO L87 Difference]: Start difference. First operand 274 states and 342 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:17,365 INFO L93 Difference]: Finished difference Result 655 states and 810 transitions. [2024-11-18 22:18:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:18:17,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-18 22:18:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:17,369 INFO L225 Difference]: With dead ends: 655 [2024-11-18 22:18:17,369 INFO L226 Difference]: Without dead ends: 404 [2024-11-18 22:18:17,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:18:17,370 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 65 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:17,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 161 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:18:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-18 22:18:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 342. [2024-11-18 22:18:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 224 states have (on average 1.0892857142857142) internal successors, (244), 228 states have internal predecessors, (244), 90 states have call successors, (90), 27 states have call predecessors, (90), 27 states have return successors, (90), 86 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-18 22:18:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 424 transitions. [2024-11-18 22:18:17,453 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 424 transitions. Word has length 123 [2024-11-18 22:18:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:17,454 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 424 transitions. [2024-11-18 22:18:17,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 424 transitions. [2024-11-18 22:18:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-18 22:18:17,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:17,458 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:17,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 22:18:17,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:17,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1588499968, now seen corresponding path program 1 times [2024-11-18 22:18:17,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:17,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130155909] [2024-11-18 22:18:17,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:17,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 22:18:17,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:17,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130155909] [2024-11-18 22:18:17,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130155909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:17,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:17,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:18:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036490135] [2024-11-18 22:18:17,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:17,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:18:17,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:17,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:18:17,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:18:17,529 INFO L87 Difference]: Start difference. First operand 342 states and 424 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 22:18:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:17,651 INFO L93 Difference]: Finished difference Result 525 states and 648 transitions. [2024-11-18 22:18:17,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:18:17,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 123 [2024-11-18 22:18:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:17,655 INFO L225 Difference]: With dead ends: 525 [2024-11-18 22:18:17,655 INFO L226 Difference]: Without dead ends: 341 [2024-11-18 22:18:17,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:18:17,656 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 62 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:17,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 114 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:18:17,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-18 22:18:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-11-18 22:18:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 223 states have (on average 1.0807174887892377) internal successors, (241), 227 states have internal predecessors, (241), 90 states have call successors, (90), 27 states have call predecessors, (90), 27 states have return successors, (90), 86 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-18 22:18:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 421 transitions. [2024-11-18 22:18:17,704 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 421 transitions. Word has length 123 [2024-11-18 22:18:17,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:17,705 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 421 transitions. [2024-11-18 22:18:17,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 22:18:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 421 transitions. [2024-11-18 22:18:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-18 22:18:17,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:17,706 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:17,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 22:18:17,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:17,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:17,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1016670393, now seen corresponding path program 1 times [2024-11-18 22:18:17,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:17,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740242489] [2024-11-18 22:18:17,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:17,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 135 proven. 33 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-11-18 22:18:18,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740242489] [2024-11-18 22:18:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740242489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:18:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576162661] [2024-11-18 22:18:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:18,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:18,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:18,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:18:18,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 22:18:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:18,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-18 22:18:18,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:19,996 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 480 proven. 33 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-18 22:18:19,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:18:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-18 22:18:20,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576162661] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:18:20,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:18:20,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 17] total 42 [2024-11-18 22:18:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118870581] [2024-11-18 22:18:20,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:18:20,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-18 22:18:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:20,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-18 22:18:20,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2024-11-18 22:18:20,974 INFO L87 Difference]: Start difference. First operand 341 states and 421 transitions. Second operand has 42 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 42 states have internal predecessors, (109), 9 states have call successors, (42), 5 states have call predecessors, (42), 11 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2024-11-18 22:18:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:22,249 INFO L93 Difference]: Finished difference Result 389 states and 468 transitions. [2024-11-18 22:18:22,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-18 22:18:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 42 states have internal predecessors, (109), 9 states have call successors, (42), 5 states have call predecessors, (42), 11 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 123 [2024-11-18 22:18:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:22,252 INFO L225 Difference]: With dead ends: 389 [2024-11-18 22:18:22,252 INFO L226 Difference]: Without dead ends: 387 [2024-11-18 22:18:22,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=679, Invalid=2513, Unknown=0, NotChecked=0, Total=3192 [2024-11-18 22:18:22,254 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 156 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:22,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 484 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 22:18:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-18 22:18:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 347. [2024-11-18 22:18:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 232 states have (on average 1.0732758620689655) internal successors, (249), 236 states have internal predecessors, (249), 85 states have call successors, (85), 29 states have call predecessors, (85), 29 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-18 22:18:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 419 transitions. [2024-11-18 22:18:22,307 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 419 transitions. Word has length 123 [2024-11-18 22:18:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:22,307 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 419 transitions. [2024-11-18 22:18:22,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 42 states have internal predecessors, (109), 9 states have call successors, (42), 5 states have call predecessors, (42), 11 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2024-11-18 22:18:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 419 transitions. [2024-11-18 22:18:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-18 22:18:22,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:22,309 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:22,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 22:18:22,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:22,510 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:22,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1244896759, now seen corresponding path program 1 times [2024-11-18 22:18:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:22,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866808551] [2024-11-18 22:18:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:22,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 22:18:22,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:22,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866808551] [2024-11-18 22:18:22,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866808551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:18:22,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213576012] [2024-11-18 22:18:22,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:22,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:22,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:22,674 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:18:22,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 22:18:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:22,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 22:18:22,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 323 proven. 24 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-18 22:18:23,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:18:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 22:18:23,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213576012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:18:23,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:18:23,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2024-11-18 22:18:23,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382502533] [2024-11-18 22:18:23,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:18:23,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-18 22:18:23,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:23,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-18 22:18:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-18 22:18:23,187 INFO L87 Difference]: Start difference. First operand 347 states and 419 transitions. Second operand has 17 states, 16 states have (on average 5.5) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-18 22:18:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:23,988 INFO L93 Difference]: Finished difference Result 1017 states and 1218 transitions. [2024-11-18 22:18:23,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-18 22:18:23,988 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.5) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) Word has length 124 [2024-11-18 22:18:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:23,993 INFO L225 Difference]: With dead ends: 1017 [2024-11-18 22:18:23,993 INFO L226 Difference]: Without dead ends: 693 [2024-11-18 22:18:23,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2024-11-18 22:18:23,995 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 407 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:23,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 529 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 22:18:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-18 22:18:24,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 316. [2024-11-18 22:18:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 213 states have (on average 1.0704225352112675) internal successors, (228), 216 states have internal predecessors, (228), 75 states have call successors, (75), 27 states have call predecessors, (75), 27 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-18 22:18:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 378 transitions. [2024-11-18 22:18:24,072 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 378 transitions. Word has length 124 [2024-11-18 22:18:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:24,072 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 378 transitions. [2024-11-18 22:18:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.5) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 6 states have call predecessors, (54), 6 states have call successors, (54) [2024-11-18 22:18:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 378 transitions. [2024-11-18 22:18:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-18 22:18:24,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:24,074 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:24,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 22:18:24,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-18 22:18:24,275 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:24,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:24,276 INFO L85 PathProgramCache]: Analyzing trace with hash 197587415, now seen corresponding path program 1 times [2024-11-18 22:18:24,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:24,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665632595] [2024-11-18 22:18:24,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:24,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 22:18:24,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:24,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665632595] [2024-11-18 22:18:24,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665632595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:24,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:24,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:18:24,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516125189] [2024-11-18 22:18:24,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:24,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:18:24,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:24,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:18:24,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:18:24,316 INFO L87 Difference]: Start difference. First operand 316 states and 378 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:24,404 INFO L93 Difference]: Finished difference Result 686 states and 817 transitions. [2024-11-18 22:18:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:18:24,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-18 22:18:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:24,408 INFO L225 Difference]: With dead ends: 686 [2024-11-18 22:18:24,408 INFO L226 Difference]: Without dead ends: 403 [2024-11-18 22:18:24,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:18:24,409 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:24,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 209 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:18:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-18 22:18:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 287. [2024-11-18 22:18:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 197 states have (on average 1.0659898477157361) internal successors, (210), 199 states have internal predecessors, (210), 65 states have call successors, (65), 24 states have call predecessors, (65), 24 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-18 22:18:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 340 transitions. [2024-11-18 22:18:24,453 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 340 transitions. Word has length 124 [2024-11-18 22:18:24,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:24,454 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 340 transitions. [2024-11-18 22:18:24,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 340 transitions. [2024-11-18 22:18:24,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-18 22:18:24,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:24,456 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:24,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 22:18:24,456 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:24,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash -239012709, now seen corresponding path program 1 times [2024-11-18 22:18:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:24,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964780936] [2024-11-18 22:18:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 33 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-18 22:18:25,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:18:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964780936] [2024-11-18 22:18:25,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964780936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:18:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346656824] [2024-11-18 22:18:25,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:25,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:18:25,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:25,523 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:18:25,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 22:18:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:25,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-18 22:18:25,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 378 proven. 33 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-18 22:18:26,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:18:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-18 22:18:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346656824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:18:27,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:18:27,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 15] total 33 [2024-11-18 22:18:27,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622703046] [2024-11-18 22:18:27,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:18:27,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-18 22:18:27,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:18:27,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-18 22:18:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2024-11-18 22:18:27,466 INFO L87 Difference]: Start difference. First operand 287 states and 340 transitions. Second operand has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-18 22:18:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:28,554 INFO L93 Difference]: Finished difference Result 495 states and 586 transitions. [2024-11-18 22:18:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-18 22:18:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 125 [2024-11-18 22:18:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:28,557 INFO L225 Difference]: With dead ends: 495 [2024-11-18 22:18:28,557 INFO L226 Difference]: Without dead ends: 333 [2024-11-18 22:18:28,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 230 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=525, Invalid=1545, Unknown=0, NotChecked=0, Total=2070 [2024-11-18 22:18:28,559 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 179 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:28,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 574 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 22:18:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-18 22:18:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 295. [2024-11-18 22:18:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 205 states have (on average 1.0634146341463415) internal successors, (218), 207 states have internal predecessors, (218), 65 states have call successors, (65), 24 states have call predecessors, (65), 24 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-18 22:18:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 348 transitions. [2024-11-18 22:18:28,607 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 348 transitions. Word has length 125 [2024-11-18 22:18:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:28,607 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 348 transitions. [2024-11-18 22:18:28,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-18 22:18:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 348 transitions. [2024-11-18 22:18:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-18 22:18:28,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:28,608 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:28,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-18 22:18:28,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-18 22:18:28,809 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:28,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:28,810 INFO L85 PathProgramCache]: Analyzing trace with hash 605084724, now seen corresponding path program 1 times [2024-11-18 22:18:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:18:28,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627707123] [2024-11-18 22:18:28,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:28,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:18:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:18:28,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:18:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:18:28,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:18:28,932 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:18:28,933 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:18:28,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-18 22:18:28,940 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:29,031 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:18:29,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:18:29 BoogieIcfgContainer [2024-11-18 22:18:29,041 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:18:29,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:18:29,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:18:29,042 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:18:29,042 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:03" (3/4) ... [2024-11-18 22:18:29,045 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:18:29,046 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:18:29,046 INFO L158 Benchmark]: Toolchain (without parser) took 26250.26ms. Allocated memory was 157.3MB in the beginning and 448.8MB in the end (delta: 291.5MB). Free memory was 102.7MB in the beginning and 166.2MB in the end (delta: -63.5MB). Peak memory consumption was 231.1MB. Max. memory is 16.1GB. [2024-11-18 22:18:29,047 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:18:29,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.18ms. Allocated memory is still 157.3MB. Free memory was 102.1MB in the beginning and 88.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 22:18:29,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.31ms. Allocated memory is still 157.3MB. Free memory was 88.3MB in the beginning and 86.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:18:29,048 INFO L158 Benchmark]: Boogie Preprocessor took 50.67ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 83.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 22:18:29,048 INFO L158 Benchmark]: RCFGBuilder took 469.04ms. Allocated memory is still 157.3MB. Free memory was 83.2MB in the beginning and 65.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 22:18:29,049 INFO L158 Benchmark]: TraceAbstraction took 25370.36ms. Allocated memory was 157.3MB in the beginning and 448.8MB in the end (delta: 291.5MB). Free memory was 65.0MB in the beginning and 166.2MB in the end (delta: -101.3MB). Peak memory consumption was 193.4MB. Max. memory is 16.1GB. [2024-11-18 22:18:29,050 INFO L158 Benchmark]: Witness Printer took 4.57ms. Allocated memory is still 448.8MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:18:29,051 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 157.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.18ms. Allocated memory is still 157.3MB. Free memory was 102.1MB in the beginning and 88.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.31ms. Allocated memory is still 157.3MB. Free memory was 88.3MB in the beginning and 86.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.67ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 83.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 469.04ms. Allocated memory is still 157.3MB. Free memory was 83.2MB in the beginning and 65.2MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25370.36ms. Allocated memory was 157.3MB in the beginning and 448.8MB in the end (delta: 291.5MB). Free memory was 65.0MB in the beginning and 166.2MB in the end (delta: -101.3MB). Peak memory consumption was 193.4MB. Max. memory is 16.1GB. * Witness Printer took 4.57ms. Allocated memory is still 448.8MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of bitwiseOr at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed short int var_1_7 = 32; [L24] signed short int var_1_8 = 20113; [L25] signed short int var_1_9 = 100; [L26] signed char var_1_10 = 100; [L27] signed char var_1_11 = -1; [L28] signed char var_1_12 = 16; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 1; [L32] unsigned short int var_1_18 = 10; [L33] unsigned short int var_1_19 = 256; [L34] signed long int var_1_20 = 32; [L35] signed long int var_1_21 = 127; [L36] signed short int var_1_22 = 128; VAL [isInitial=0, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=32, var_1_8=20113, var_1_9=100] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L72] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=20113, var_1_9=100] [L73] var_1_8 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L75] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=100] [L76] var_1_9 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L78] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L79] var_1_11 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L80] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L81] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L82] var_1_12 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L83] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L84] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L86] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L87] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L88] var_1_16 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L89] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L90] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L91] var_1_19 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L93] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=127, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L94] var_1_21 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_21 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L95] RET assume_abort_if_not(var_1_21 >= -2147483648) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_21 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L96] RET assume_abort_if_not(var_1_21 <= 2147483647) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=65534, var_1_1=16, var_1_20=32, var_1_21=0, var_1_22=128, var_1_7=-1, var_1_8=32766, var_1_9=0] [L109] RET updateVariables() [L110] CALL step() [L40] var_1_18 = var_1_19 [L41] var_1_20 = var_1_21 [L42] var_1_22 = var_1_12 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L43] COND FALSE !(127.5f > var_1_20) [L46] var_1_13 = ((var_1_20 >= var_1_20) || var_1_15) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L48] COND FALSE !(var_1_18 == var_1_7) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L51] EXPR (32 * -25) | var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L51] COND FALSE !(((32 * -25) | var_1_22) >= var_1_11) [L57] COND TRUE \read(var_1_13) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L58] COND TRUE var_1_10 > var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L59] COND TRUE \read(var_1_13) [L60] var_1_1 = (var_1_7 - (var_1_8 - var_1_9)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L101] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L101] EXPR (32 * -25) | var_1_22 VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L101] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L101] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L101-L102] return (((((var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1))) && ((127.5f > var_1_20) ? (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))) : (var_1_13 == ((unsigned char) ((var_1_20 >= var_1_20) || var_1_15))))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((signed long int) var_1_21))) && (var_1_22 == ((signed short int) var_1_12)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=65534, var_1_19=65534, var_1_1=-32767, var_1_20=0, var_1_21=0, var_1_22=-31, var_1_7=-1, var_1_8=32766, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 16, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2025 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1923 mSDsluCounter, 4149 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2702 mSDsCounter, 810 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6084 IncrementalHoareTripleChecker+Invalid, 6894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 810 mSolverCounterUnsat, 1447 mSDtfsCounter, 6084 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1523 GetRequests, 1263 SyntacticMatches, 9 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3263 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=12, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 801 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 2630 NumberOfCodeBlocks, 2630 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3082 ConstructedInterpolants, 0 QuantifiedInterpolants, 13211 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1646 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 15353/15912 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 22:18:29,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.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 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:18:31,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:18:31,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:18:31,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:18:31,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:18:31,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:18:31,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:18:31,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:18:31,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:18:31,327 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:18:31,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:18:31,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:18:31,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:18:31,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:18:31,330 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:18:31,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:18:31,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:18:31,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:18:31,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:18:31,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:18:31,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:18:31,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:18:31,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:18:31,337 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:18:31,337 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:18:31,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:18:31,339 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:18:31,339 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:18:31,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:18:31,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:18:31,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:18:31,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:18:31,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:18:31,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:18:31,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:18:31,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:18:31,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:18:31,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:18:31,344 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:18:31,345 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:18:31,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:18:31,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:18:31,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:18:31,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:18:31,347 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 -> 97ff03298340a9336a03e9d19ed0d00b1afc963b5be61528526d9d1b67b2a323 [2024-11-18 22:18:31,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:18:31,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:18:31,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:18:31,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:18:31,715 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:18:31,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-18 22:18:33,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:18:33,541 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:18:33,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-18 22:18:33,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f9eeb42/93ef82f7a3ca47df94f53baf8a1fc74f/FLAG1e35828df [2024-11-18 22:18:33,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f9eeb42/93ef82f7a3ca47df94f53baf8a1fc74f [2024-11-18 22:18:33,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:18:33,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:18:33,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:18:33,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:18:33,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:18:33,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:33,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c926f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33, skipping insertion in model container [2024-11-18 22:18:33,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:33,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:18:33,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i[916,929] [2024-11-18 22:18:33,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:18:33,883 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:18:33,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-97.i[916,929] [2024-11-18 22:18:33,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:18:33,942 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:18:33,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33 WrapperNode [2024-11-18 22:18:33,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:18:33,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:18:33,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:18:33,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:18:33,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:33,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:33,990 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-11-18 22:18:33,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:18:33,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:18:33,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:18:33,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:18:34,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:34,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:34,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:34,029 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:18:34,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:34,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:34,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:34,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:34,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:34,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:34,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:18:34,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:18:34,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:18:34,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:18:34,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (1/1) ... [2024-11-18 22:18:34,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:18:34,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:18:34,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 22:18:34,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 22:18:34,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:18:34,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:18:34,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:18:34,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:18:34,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:18:34,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:18:34,247 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:18:34,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:18:34,647 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-18 22:18:34,648 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:18:34,660 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:18:34,660 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:18:34,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:34 BoogieIcfgContainer [2024-11-18 22:18:34,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:18:34,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:18:34,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:18:34,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:18:34,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:18:33" (1/3) ... [2024-11-18 22:18:34,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f91b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:18:34, skipping insertion in model container [2024-11-18 22:18:34,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:18:33" (2/3) ... [2024-11-18 22:18:34,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f91b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:18:34, skipping insertion in model container [2024-11-18 22:18:34,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:18:34" (3/3) ... [2024-11-18 22:18:34,670 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-97.i [2024-11-18 22:18:34,686 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:18:34,687 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:18:34,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:18:34,742 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;@4bc8b832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:18:34,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:18:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:18:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 22:18:34,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:34,761 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:34,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:34,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:34,766 INFO L85 PathProgramCache]: Analyzing trace with hash 73183195, now seen corresponding path program 1 times [2024-11-18 22:18:34,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:18:34,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731615120] [2024-11-18 22:18:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:34,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:18:34,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:18:34,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:18:34,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 22:18:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:34,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:18:34,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-18 22:18:35,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:18:35,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:18:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731615120] [2024-11-18 22:18:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731615120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:35,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:35,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:18:35,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956556504] [2024-11-18 22:18:35,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:35,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:18:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:18:35,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:18:35,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:18:35,070 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 22:18:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:35,094 INFO L93 Difference]: Finished difference Result 99 states and 172 transitions. [2024-11-18 22:18:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:18:35,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2024-11-18 22:18:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:35,102 INFO L225 Difference]: With dead ends: 99 [2024-11-18 22:18:35,102 INFO L226 Difference]: Without dead ends: 49 [2024-11-18 22:18:35,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:18:35,108 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:35,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:18:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-18 22:18:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-18 22:18:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:18:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2024-11-18 22:18:35,142 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 111 [2024-11-18 22:18:35,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:35,142 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2024-11-18 22:18:35,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 22:18:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-11-18 22:18:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 22:18:35,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:35,145 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:35,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 22:18:35,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:18:35,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:35,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:35,348 INFO L85 PathProgramCache]: Analyzing trace with hash 753856795, now seen corresponding path program 1 times [2024-11-18 22:18:35,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:18:35,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088743835] [2024-11-18 22:18:35,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:35,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:18:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:18:35,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:18:35,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 22:18:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:35,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 22:18:35,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 22:18:35,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:18:35,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:18:35,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088743835] [2024-11-18 22:18:35,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088743835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:18:35,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:18:35,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:18:35,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695510771] [2024-11-18 22:18:35,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:18:35,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:18:35,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:18:35,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:18:35,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:18:35,635 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:35,957 INFO L93 Difference]: Finished difference Result 141 states and 213 transitions. [2024-11-18 22:18:35,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:18:35,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-11-18 22:18:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:35,961 INFO L225 Difference]: With dead ends: 141 [2024-11-18 22:18:35,961 INFO L226 Difference]: Without dead ends: 95 [2024-11-18 22:18:35,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:18:35,963 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:35,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 136 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 22:18:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-18 22:18:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 55. [2024-11-18 22:18:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:18:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-11-18 22:18:35,984 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 111 [2024-11-18 22:18:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:35,986 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-11-18 22:18:35,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 22:18:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-11-18 22:18:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-18 22:18:35,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:35,992 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:35,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-18 22:18:36,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:18:36,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:36,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1021150567, now seen corresponding path program 1 times [2024-11-18 22:18:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:18:36,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328826949] [2024-11-18 22:18:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:36,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:18:36,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:18:36,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:18:36,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 22:18:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:36,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 22:18:36,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:18:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 348 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-18 22:18:36,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:18:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-18 22:18:37,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:18:37,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328826949] [2024-11-18 22:18:37,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328826949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:18:37,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 22:18:37,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-11-18 22:18:37,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890737692] [2024-11-18 22:18:37,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 22:18:37,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 22:18:37,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:18:37,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 22:18:37,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-18 22:18:37,071 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-18 22:18:38,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:18:38,170 INFO L93 Difference]: Finished difference Result 139 states and 203 transitions. [2024-11-18 22:18:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 22:18:38,171 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 111 [2024-11-18 22:18:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:18:38,175 INFO L225 Difference]: With dead ends: 139 [2024-11-18 22:18:38,175 INFO L226 Difference]: Without dead ends: 87 [2024-11-18 22:18:38,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2024-11-18 22:18:38,180 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 111 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 22:18:38,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 129 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 22:18:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-18 22:18:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2024-11-18 22:18:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-18 22:18:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-11-18 22:18:38,207 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 111 [2024-11-18 22:18:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:18:38,207 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-11-18 22:18:38,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-18 22:18:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-11-18 22:18:38,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-18 22:18:38,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:18:38,210 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:18:38,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 22:18:38,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:18:38,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:18:38,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:18:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1489236011, now seen corresponding path program 1 times [2024-11-18 22:18:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:18:38,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58423306] [2024-11-18 22:18:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:18:38,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:18:38,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:18:38,416 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:18:38,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-18 22:18:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:18:38,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-18 22:18:38,508 INFO L278 TraceCheckSpWp]: Computing forward predicates...