./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.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 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:06:40,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:06:40,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:06:40,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:06:40,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:06:40,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:06:40,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:06:40,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:06:40,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:06:40,536 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:06:40,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:06:40,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:06:40,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:06:40,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:06:40,538 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:06:40,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:06:40,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:06:40,542 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:06:40,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:06:40,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:06:40,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:06:40,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:06:40,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:06:40,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:06:40,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:06:40,546 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:06:40,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:06:40,547 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:06:40,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:06:40,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:06:40,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:06:40,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:06:40,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:06:40,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:06:40,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:06:40,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:06:40,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:06:40,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:06:40,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:06:40,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:06:40,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:06:40,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:06:40,552 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 -> 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc [2024-10-14 11:06:40,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:06:40,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:06:40,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:06:40,835 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:06:40,836 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:06:40,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-14 11:06:42,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:06:42,481 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:06:42,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-14 11:06:42,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0683a34/06b7365a519243d2aabd60cf49ce6fea/FLAG72ad3a21a [2024-10-14 11:06:42,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0683a34/06b7365a519243d2aabd60cf49ce6fea [2024-10-14 11:06:42,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:06:42,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:06:42,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:06:42,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:06:42,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:06:42,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4e5a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42, skipping insertion in model container [2024-10-14 11:06:42,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:06:42,684 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-10-14 11:06:42,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:06:42,741 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:06:42,756 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-10-14 11:06:42,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:06:42,801 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:06:42,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42 WrapperNode [2024-10-14 11:06:42,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:06:42,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:06:42,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:06:42,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:06:42,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,854 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-10-14 11:06:42,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:06:42,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:06:42,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:06:42,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:06:42,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,904 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:06:42,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:06:42,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:06:42,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:06:42,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:06:42,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (1/1) ... [2024-10-14 11:06:42,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:06:43,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:06:43,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:06:43,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:06:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:06:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:06:43,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:06:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:06:43,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:06:43,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:06:43,171 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:06:43,173 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:06:43,451 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 11:06:43,452 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:06:43,486 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:06:43,486 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:06:43,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:06:43 BoogieIcfgContainer [2024-10-14 11:06:43,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:06:43,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:06:43,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:06:43,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:06:43,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:06:42" (1/3) ... [2024-10-14 11:06:43,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119fda11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:06:43, skipping insertion in model container [2024-10-14 11:06:43,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:42" (2/3) ... [2024-10-14 11:06:43,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119fda11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:06:43, skipping insertion in model container [2024-10-14 11:06:43,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:06:43" (3/3) ... [2024-10-14 11:06:43,494 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-14 11:06:43,507 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:06:43,507 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:06:43,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:06:43,580 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;@337eb402, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:06:43,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:06:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 11:06:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 11:06:43,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:43,597 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:43,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:43,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:43,602 INFO L85 PathProgramCache]: Analyzing trace with hash 455106167, now seen corresponding path program 1 times [2024-10-14 11:06:43,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:43,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192285232] [2024-10-14 11:06:43,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:43,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:43,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:43,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192285232] [2024-10-14 11:06:43,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192285232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:43,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:43,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:06:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512682850] [2024-10-14 11:06:43,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:43,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:06:43,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:43,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:06:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:06:43,921 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 11:06:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:43,954 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2024-10-14 11:06:43,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:06:43,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-10-14 11:06:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:43,966 INFO L225 Difference]: With dead ends: 113 [2024-10-14 11:06:43,966 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 11:06:43,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:06:43,972 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:43,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:06:43,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 11:06:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-14 11:06:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 11:06:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2024-10-14 11:06:44,019 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 103 [2024-10-14 11:06:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:44,020 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2024-10-14 11:06:44,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 11:06:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2024-10-14 11:06:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 11:06:44,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:44,026 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:44,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:06:44,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:44,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:44,027 INFO L85 PathProgramCache]: Analyzing trace with hash 885472887, now seen corresponding path program 1 times [2024-10-14 11:06:44,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:44,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632295833] [2024-10-14 11:06:44,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:44,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:44,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:44,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632295833] [2024-10-14 11:06:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632295833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:44,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:44,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:06:44,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163686770] [2024-10-14 11:06:44,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:44,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:06:44,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:44,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:06:44,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:06:44,357 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:44,434 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2024-10-14 11:06:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:06:44,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-10-14 11:06:44,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:44,436 INFO L225 Difference]: With dead ends: 111 [2024-10-14 11:06:44,437 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 11:06:44,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:06:44,440 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:44,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:06:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 11:06:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-14 11:06:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 11:06:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2024-10-14 11:06:44,457 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 103 [2024-10-14 11:06:44,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:44,460 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2024-10-14 11:06:44,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2024-10-14 11:06:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 11:06:44,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:44,463 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:44,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:06:44,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:44,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1922342594, now seen corresponding path program 1 times [2024-10-14 11:06:44,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:44,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698664791] [2024-10-14 11:06:44,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:44,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:45,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:45,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698664791] [2024-10-14 11:06:45,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698664791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:45,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:45,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:06:45,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801408851] [2024-10-14 11:06:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:45,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:06:45,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:45,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:06:45,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:06:45,482 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:45,804 INFO L93 Difference]: Finished difference Result 183 states and 255 transitions. [2024-10-14 11:06:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:06:45,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-14 11:06:45,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:45,808 INFO L225 Difference]: With dead ends: 183 [2024-10-14 11:06:45,808 INFO L226 Difference]: Without dead ends: 128 [2024-10-14 11:06:45,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:06:45,814 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 114 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:45,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 240 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:06:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-14 11:06:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2024-10-14 11:06:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 73 states have internal predecessors, (95), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 11:06:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-10-14 11:06:45,840 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 105 [2024-10-14 11:06:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:45,842 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-10-14 11:06:45,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-10-14 11:06:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 11:06:45,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:45,846 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:45,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:06:45,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:45,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:45,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1563278076, now seen corresponding path program 1 times [2024-10-14 11:06:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:45,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294219840] [2024-10-14 11:06:45,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:45,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:46,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:46,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:46,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:46,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:46,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:46,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294219840] [2024-10-14 11:06:46,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294219840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:46,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:46,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:06:46,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819780434] [2024-10-14 11:06:46,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:46,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:06:46,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:46,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:06:46,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:06:46,020 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:46,078 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2024-10-14 11:06:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:06:46,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-14 11:06:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:46,081 INFO L225 Difference]: With dead ends: 185 [2024-10-14 11:06:46,081 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 11:06:46,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:06:46,083 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:46,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:06:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 11:06:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-14 11:06:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 73 states have internal predecessors, (93), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 11:06:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2024-10-14 11:06:46,097 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 105 [2024-10-14 11:06:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:46,098 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2024-10-14 11:06:46,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-10-14 11:06:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 11:06:46,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:46,102 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:46,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:06:46,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:46,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1620536378, now seen corresponding path program 1 times [2024-10-14 11:06:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:46,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615130374] [2024-10-14 11:06:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:47,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:47,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615130374] [2024-10-14 11:06:47,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615130374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:47,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:47,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:06:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19404600] [2024-10-14 11:06:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:47,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:06:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:47,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:06:47,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:06:47,374 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:47,799 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2024-10-14 11:06:47,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:06:47,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-14 11:06:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:47,804 INFO L225 Difference]: With dead ends: 208 [2024-10-14 11:06:47,804 INFO L226 Difference]: Without dead ends: 116 [2024-10-14 11:06:47,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:06:47,806 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 70 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:47,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 165 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 11:06:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-14 11:06:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2024-10-14 11:06:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 80 states have internal predecessors, (101), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 11:06:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2024-10-14 11:06:47,824 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 105 [2024-10-14 11:06:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:47,828 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2024-10-14 11:06:47,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2024-10-14 11:06:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 11:06:47,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:47,830 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:47,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:06:47,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:47,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1418765754, now seen corresponding path program 1 times [2024-10-14 11:06:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:47,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064601816] [2024-10-14 11:06:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:47,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:51,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064601816] [2024-10-14 11:06:51,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064601816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:51,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:51,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 11:06:51,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136216456] [2024-10-14 11:06:51,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:51,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 11:06:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:51,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 11:06:51,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:06:51,880 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:53,346 INFO L93 Difference]: Finished difference Result 234 states and 315 transitions. [2024-10-14 11:06:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:06:53,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-14 11:06:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:53,348 INFO L225 Difference]: With dead ends: 234 [2024-10-14 11:06:53,348 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 11:06:53,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-14 11:06:53,350 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 114 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:53,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 368 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 11:06:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 11:06:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2024-10-14 11:06:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 82 states have internal predecessors, (104), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 11:06:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 140 transitions. [2024-10-14 11:06:53,370 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 140 transitions. Word has length 105 [2024-10-14 11:06:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:53,370 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 140 transitions. [2024-10-14 11:06:53,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 140 transitions. [2024-10-14 11:06:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 11:06:53,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:53,372 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:53,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 11:06:53,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:53,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash 609419128, now seen corresponding path program 1 times [2024-10-14 11:06:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:53,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183972398] [2024-10-14 11:06:53,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:54,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:54,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183972398] [2024-10-14 11:06:54,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183972398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:54,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:54,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:06:54,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220203901] [2024-10-14 11:06:54,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:54,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:06:54,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:54,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:06:54,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:06:54,676 INFO L87 Difference]: Start difference. First operand 102 states and 140 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:55,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:55,195 INFO L93 Difference]: Finished difference Result 220 states and 299 transitions. [2024-10-14 11:06:55,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:06:55,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-14 11:06:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:55,197 INFO L225 Difference]: With dead ends: 220 [2024-10-14 11:06:55,197 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 11:06:55,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:06:55,199 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 44 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:55,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 202 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 11:06:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 11:06:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2024-10-14 11:06:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 73 states have internal predecessors, (92), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 11:06:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2024-10-14 11:06:55,210 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 105 [2024-10-14 11:06:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:55,210 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2024-10-14 11:06:55,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2024-10-14 11:06:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 11:06:55,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:55,212 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:55,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 11:06:55,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:55,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:55,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1150019326, now seen corresponding path program 1 times [2024-10-14 11:06:55,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:55,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691665654] [2024-10-14 11:06:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:55,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:55,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:55,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691665654] [2024-10-14 11:06:55,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691665654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:55,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:55,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:06:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528721939] [2024-10-14 11:06:55,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:55,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:06:55,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:55,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:06:55,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:06:55,276 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:55,299 INFO L93 Difference]: Finished difference Result 188 states and 257 transitions. [2024-10-14 11:06:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:06:55,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-14 11:06:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:55,301 INFO L225 Difference]: With dead ends: 188 [2024-10-14 11:06:55,301 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 11:06:55,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:06:55,304 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 32 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:55,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 171 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:06:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 11:06:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2024-10-14 11:06:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 73 states have internal predecessors, (91), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 11:06:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2024-10-14 11:06:55,323 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 105 [2024-10-14 11:06:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:55,324 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2024-10-14 11:06:55,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2024-10-14 11:06:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 11:06:55,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:55,325 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:55,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 11:06:55,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:55,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash 138902076, now seen corresponding path program 1 times [2024-10-14 11:06:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140253375] [2024-10-14 11:06:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:55,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:55,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140253375] [2024-10-14 11:06:55,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140253375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:55,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:55,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:06:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80658148] [2024-10-14 11:06:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:55,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:06:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:06:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:06:55,470 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:55,512 INFO L93 Difference]: Finished difference Result 188 states and 255 transitions. [2024-10-14 11:06:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:06:55,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-14 11:06:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:55,514 INFO L225 Difference]: With dead ends: 188 [2024-10-14 11:06:55,514 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 11:06:55,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:06:55,515 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 22 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:55,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 272 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:06:55,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 11:06:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2024-10-14 11:06:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 11:06:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2024-10-14 11:06:55,531 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 105 [2024-10-14 11:06:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:55,532 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2024-10-14 11:06:55,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2024-10-14 11:06:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 11:06:55,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:55,533 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:55,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 11:06:55,534 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:55,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:55,534 INFO L85 PathProgramCache]: Analyzing trace with hash -425958218, now seen corresponding path program 1 times [2024-10-14 11:06:55,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:55,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027562978] [2024-10-14 11:06:55,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:55,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:55,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027562978] [2024-10-14 11:06:55,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027562978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:55,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:55,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:06:55,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695760598] [2024-10-14 11:06:55,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:55,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:06:55,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:55,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:06:55,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:06:55,615 INFO L87 Difference]: Start difference. First operand 93 states and 126 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:55,653 INFO L93 Difference]: Finished difference Result 185 states and 251 transitions. [2024-10-14 11:06:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:06:55,654 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-10-14 11:06:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:55,655 INFO L225 Difference]: With dead ends: 185 [2024-10-14 11:06:55,655 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 11:06:55,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:06:55,656 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:55,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:06:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 11:06:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-14 11:06:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 73 states have internal predecessors, (88), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 11:06:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2024-10-14 11:06:55,665 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 108 [2024-10-14 11:06:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:55,666 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2024-10-14 11:06:55,666 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2024-10-14 11:06:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 11:06:55,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:55,667 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:55,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 11:06:55,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:55,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash 183947901, now seen corresponding path program 1 times [2024-10-14 11:06:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170934060] [2024-10-14 11:06:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:55,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:56,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:56,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170934060] [2024-10-14 11:06:56,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170934060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:56,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:56,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 11:06:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710778965] [2024-10-14 11:06:56,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:56,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 11:06:56,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 11:06:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 11:06:56,563 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:06:57,268 INFO L93 Difference]: Finished difference Result 209 states and 261 transitions. [2024-10-14 11:06:57,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 11:06:57,268 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-10-14 11:06:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:06:57,270 INFO L225 Difference]: With dead ends: 209 [2024-10-14 11:06:57,270 INFO L226 Difference]: Without dead ends: 207 [2024-10-14 11:06:57,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-10-14 11:06:57,271 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 258 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 11:06:57,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 313 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 11:06:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-14 11:06:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 136. [2024-10-14 11:06:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.198019801980198) internal successors, (121), 103 states have internal predecessors, (121), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 11:06:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2024-10-14 11:06:57,291 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 110 [2024-10-14 11:06:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:06:57,291 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2024-10-14 11:06:57,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:06:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2024-10-14 11:06:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 11:06:57,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:06:57,293 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:06:57,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 11:06:57,293 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:06:57,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:06:57,294 INFO L85 PathProgramCache]: Analyzing trace with hash -918189827, now seen corresponding path program 1 times [2024-10-14 11:06:57,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:06:57,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212630780] [2024-10-14 11:06:57,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:06:57,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:06:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:06:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:06:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:06:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:06:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:06:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:06:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:06:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:06:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:06:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:06:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:06:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:06:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:06:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:06:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:06:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:06:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:06:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:06:58,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:06:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212630780] [2024-10-14 11:06:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212630780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:06:58,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:06:58,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 11:06:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835492695] [2024-10-14 11:06:58,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:06:58,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 11:06:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:06:58,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 11:06:58,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-14 11:06:58,831 INFO L87 Difference]: Start difference. First operand 136 states and 181 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:00,587 INFO L93 Difference]: Finished difference Result 215 states and 278 transitions. [2024-10-14 11:07:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 11:07:00,588 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-10-14 11:07:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:00,589 INFO L225 Difference]: With dead ends: 215 [2024-10-14 11:07:00,590 INFO L226 Difference]: Without dead ends: 213 [2024-10-14 11:07:00,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2024-10-14 11:07:00,591 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 197 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:00,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 541 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 11:07:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-14 11:07:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 178. [2024-10-14 11:07:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 129 states have (on average 1.178294573643411) internal successors, (152), 132 states have internal predecessors, (152), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 11:07:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 236 transitions. [2024-10-14 11:07:00,628 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 236 transitions. Word has length 110 [2024-10-14 11:07:00,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:00,629 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 236 transitions. [2024-10-14 11:07:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 236 transitions. [2024-10-14 11:07:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 11:07:00,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:00,631 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:00,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 11:07:00,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:00,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1504995841, now seen corresponding path program 1 times [2024-10-14 11:07:00,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:00,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208338622] [2024-10-14 11:07:00,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:07:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:07:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:07:01,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:01,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208338622] [2024-10-14 11:07:01,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208338622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:01,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:01,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 11:07:01,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737295913] [2024-10-14 11:07:01,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:01,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 11:07:01,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:01,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 11:07:01,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:07:01,397 INFO L87 Difference]: Start difference. First operand 178 states and 236 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:01,983 INFO L93 Difference]: Finished difference Result 244 states and 314 transitions. [2024-10-14 11:07:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 11:07:01,984 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-10-14 11:07:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:01,986 INFO L225 Difference]: With dead ends: 244 [2024-10-14 11:07:01,986 INFO L226 Difference]: Without dead ends: 242 [2024-10-14 11:07:01,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2024-10-14 11:07:01,987 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 116 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:01,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 507 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 11:07:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-14 11:07:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 185. [2024-10-14 11:07:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 136 states have (on average 1.1911764705882353) internal successors, (162), 139 states have internal predecessors, (162), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 11:07:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 246 transitions. [2024-10-14 11:07:02,022 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 246 transitions. Word has length 110 [2024-10-14 11:07:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:02,022 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 246 transitions. [2024-10-14 11:07:02,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 246 transitions. [2024-10-14 11:07:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 11:07:02,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:02,024 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:02,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 11:07:02,024 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:02,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:02,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1735838277, now seen corresponding path program 1 times [2024-10-14 11:07:02,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:02,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053911160] [2024-10-14 11:07:02,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:02,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:07:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:07:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:02,911 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:07:02,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:02,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053911160] [2024-10-14 11:07:02,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053911160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:02,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:02,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 11:07:02,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594481311] [2024-10-14 11:07:02,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:02,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 11:07:02,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:02,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 11:07:02,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:07:02,913 INFO L87 Difference]: Start difference. First operand 185 states and 246 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:03,442 INFO L93 Difference]: Finished difference Result 212 states and 277 transitions. [2024-10-14 11:07:03,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 11:07:03,442 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-10-14 11:07:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:03,444 INFO L225 Difference]: With dead ends: 212 [2024-10-14 11:07:03,444 INFO L226 Difference]: Without dead ends: 210 [2024-10-14 11:07:03,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2024-10-14 11:07:03,445 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 105 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:03,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 394 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 11:07:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-14 11:07:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2024-10-14 11:07:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 147 states have (on average 1.1972789115646258) internal successors, (176), 150 states have internal predecessors, (176), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 11:07:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 260 transitions. [2024-10-14 11:07:03,480 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 260 transitions. Word has length 110 [2024-10-14 11:07:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:03,481 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 260 transitions. [2024-10-14 11:07:03,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 260 transitions. [2024-10-14 11:07:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 11:07:03,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:03,486 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:03,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 11:07:03,487 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:03,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1173674330, now seen corresponding path program 1 times [2024-10-14 11:07:03,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:03,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195333152] [2024-10-14 11:07:03,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:03,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:07:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:07:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:07:03,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:03,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195333152] [2024-10-14 11:07:03,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195333152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:03,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:03,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:07:03,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227790615] [2024-10-14 11:07:03,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:03,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:07:03,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:03,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:07:03,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:07:03,555 INFO L87 Difference]: Start difference. First operand 196 states and 260 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:03,641 INFO L93 Difference]: Finished difference Result 418 states and 550 transitions. [2024-10-14 11:07:03,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:07:03,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-10-14 11:07:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:03,645 INFO L225 Difference]: With dead ends: 418 [2024-10-14 11:07:03,645 INFO L226 Difference]: Without dead ends: 245 [2024-10-14 11:07:03,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:07:03,648 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 52 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:03,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:07:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-14 11:07:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 222. [2024-10-14 11:07:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 154 states have (on average 1.1233766233766234) internal successors, (173), 158 states have internal predecessors, (173), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-14 11:07:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 289 transitions. [2024-10-14 11:07:03,705 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 289 transitions. Word has length 111 [2024-10-14 11:07:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:03,705 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 289 transitions. [2024-10-14 11:07:03,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 289 transitions. [2024-10-14 11:07:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 11:07:03,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:03,707 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:03,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 11:07:03,708 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:03,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:03,708 INFO L85 PathProgramCache]: Analyzing trace with hash -261027071, now seen corresponding path program 1 times [2024-10-14 11:07:03,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:03,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191129265] [2024-10-14 11:07:03,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:03,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:07:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:07:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 11:07:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191129265] [2024-10-14 11:07:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191129265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:03,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:07:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794568186] [2024-10-14 11:07:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:03,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:07:03,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:03,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:07:03,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:07:03,771 INFO L87 Difference]: Start difference. First operand 222 states and 289 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:03,847 INFO L93 Difference]: Finished difference Result 406 states and 525 transitions. [2024-10-14 11:07:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:07:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-14 11:07:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:03,850 INFO L225 Difference]: With dead ends: 406 [2024-10-14 11:07:03,851 INFO L226 Difference]: Without dead ends: 207 [2024-10-14 11:07:03,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:07:03,852 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 56 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:03,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 124 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:07:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-14 11:07:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 145. [2024-10-14 11:07:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 93 states have (on average 1.075268817204301) internal successors, (100), 95 states have internal predecessors, (100), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 11:07:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2024-10-14 11:07:03,880 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 112 [2024-10-14 11:07:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:03,880 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2024-10-14 11:07:03,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2024-10-14 11:07:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 11:07:03,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:03,882 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:03,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 11:07:03,882 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:03,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:03,882 INFO L85 PathProgramCache]: Analyzing trace with hash 640628027, now seen corresponding path program 1 times [2024-10-14 11:07:03,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:03,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223169120] [2024-10-14 11:07:03,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:03,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:07:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:07:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 11:07:04,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:04,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223169120] [2024-10-14 11:07:04,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223169120] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:07:04,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848776786] [2024-10-14 11:07:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:04,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:07:04,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:07:04,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:07:04,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 11:07:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:04,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 11:07:04,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:07:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-10-14 11:07:04,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:07:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848776786] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:07:04,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 11:07:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2024-10-14 11:07:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829255451] [2024-10-14 11:07:04,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 11:07:04,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:07:04,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:04,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:07:04,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 11:07:04,757 INFO L87 Difference]: Start difference. First operand 145 states and 188 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 11:07:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:05,212 INFO L93 Difference]: Finished difference Result 343 states and 419 transitions. [2024-10-14 11:07:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 11:07:05,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 114 [2024-10-14 11:07:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:05,214 INFO L225 Difference]: With dead ends: 343 [2024-10-14 11:07:05,214 INFO L226 Difference]: Without dead ends: 221 [2024-10-14 11:07:05,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-14 11:07:05,215 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 73 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:05,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 105 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:07:05,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-14 11:07:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 150. [2024-10-14 11:07:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 97 states have internal predecessors, (100), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 11:07:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2024-10-14 11:07:05,257 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 188 transitions. Word has length 114 [2024-10-14 11:07:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:05,257 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 188 transitions. [2024-10-14 11:07:05,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 11:07:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 188 transitions. [2024-10-14 11:07:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 11:07:05,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:05,259 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:05,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 11:07:05,460 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,SelfDestructingSolverStorable16 [2024-10-14 11:07:05,461 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:05,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:05,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1164810307, now seen corresponding path program 1 times [2024-10-14 11:07:05,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:05,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551776115] [2024-10-14 11:07:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:05,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:07:05,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:07:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:07:05,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:07:05,546 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:07:05,547 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:07:05,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 11:07:05,552 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:05,652 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:07:05,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:07:05 BoogieIcfgContainer [2024-10-14 11:07:05,656 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:07:05,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:07:05,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:07:05,657 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:07:05,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:06:43" (3/4) ... [2024-10-14 11:07:05,660 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:07:05,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:07:05,662 INFO L158 Benchmark]: Toolchain (without parser) took 23153.05ms. Allocated memory was 180.4MB in the beginning and 536.9MB in the end (delta: 356.5MB). Free memory was 109.8MB in the beginning and 433.0MB in the end (delta: -323.1MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-10-14 11:07:05,662 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:07:05,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.20ms. Allocated memory is still 180.4MB. Free memory was 109.6MB in the beginning and 96.2MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 11:07:05,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.66ms. Allocated memory is still 180.4MB. Free memory was 96.2MB in the beginning and 93.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:07:05,663 INFO L158 Benchmark]: Boogie Preprocessor took 104.41ms. Allocated memory is still 180.4MB. Free memory was 93.1MB in the beginning and 151.2MB in the end (delta: -58.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-10-14 11:07:05,663 INFO L158 Benchmark]: RCFGBuilder took 525.24ms. Allocated memory is still 180.4MB. Free memory was 151.2MB in the beginning and 129.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 11:07:05,664 INFO L158 Benchmark]: TraceAbstraction took 22168.39ms. Allocated memory was 180.4MB in the beginning and 536.9MB in the end (delta: 356.5MB). Free memory was 129.8MB in the beginning and 434.0MB in the end (delta: -304.3MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2024-10-14 11:07:05,664 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 536.9MB. Free memory was 434.0MB in the beginning and 433.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:07:05,666 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.20ms. Allocated memory is still 180.4MB. Free memory was 109.6MB in the beginning and 96.2MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.66ms. Allocated memory is still 180.4MB. Free memory was 96.2MB in the beginning and 93.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.41ms. Allocated memory is still 180.4MB. Free memory was 93.1MB in the beginning and 151.2MB in the end (delta: -58.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * RCFGBuilder took 525.24ms. Allocated memory is still 180.4MB. Free memory was 151.2MB in the beginning and 129.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22168.39ms. Allocated memory was 180.4MB in the beginning and 536.9MB in the end (delta: 356.5MB). Free memory was 129.8MB in the beginning and 434.0MB in the end (delta: -304.3MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 536.9MB. Free memory was 434.0MB in the beginning and 433.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_4 = 19138; [L25] signed char var_1_6 = 25; [L26] signed long int var_1_7 = -50; [L27] signed long int var_1_8 = 8; [L28] signed long int var_1_9 = 255; [L29] signed long int var_1_10 = 10000000; [L30] signed long int var_1_11 = 0; [L31] signed long int var_1_12 = 255; [L32] unsigned char var_1_13 = 50; [L33] unsigned char var_1_14 = 2; [L34] signed char var_1_15 = 1; [L35] signed char var_1_16 = 5; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=255] [L67] var_1_9 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L68] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L69] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L69] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=10000000, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L70] var_1_10 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L71] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L72] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L73] var_1_11 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L74] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L75] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=255, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L76] var_1_12 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L78] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L79] var_1_14 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L80] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L81] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L82] var_1_16 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L83] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L84] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=50, var_1_14=254, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L97] RET updateVariables() [L98] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L47] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=-35620, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=-50, var_1_8=8, var_1_9=0] [L48] COND TRUE stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)))) [L49] var_1_7 = (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=8, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_1=254, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=8, var_1_9=0] [L54] COND FALSE !(var_1_13 < stepLocal_1) [L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L89-L90] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((signed long int) (var_1_9 - var_1_10))) : (var_1_8 == ((signed long int) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=2147483647, var_1_12=0, var_1_13=254, var_1_14=254, var_1_15=126, var_1_16=126, var_1_1=46630, var_1_2=1, var_1_4=-35620, var_1_6=25, var_1_7=0, var_1_8=2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 18, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1257 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1253 mSDsluCounter, 4025 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2691 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3712 IncrementalHoareTripleChecker+Invalid, 3780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 1334 mSDtfsCounter, 3712 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 871 GetRequests, 742 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=15, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 449 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 2054 NumberOfCodeBlocks, 2054 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1922 ConstructedInterpolants, 0 QuantifiedInterpolants, 11425 SizeOfPredicates, 2 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 8568/8640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 11:07:05,714 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.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 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:07:07,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:07:08,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:07:08,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:07:08,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:07:08,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:07:08,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:07:08,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:07:08,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:07:08,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:07:08,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:07:08,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:07:08,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:07:08,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:07:08,118 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:07:08,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:07:08,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:07:08,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:07:08,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:07:08,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:07:08,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:07:08,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:07:08,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:07:08,125 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:07:08,125 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:07:08,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:07:08,125 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:07:08,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:07:08,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:07:08,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:07:08,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:07:08,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:07:08,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:07:08,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:07:08,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:07:08,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:07:08,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:07:08,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:07:08,128 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:07:08,131 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:07:08,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:07:08,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:07:08,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:07:08,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:07:08,132 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:07:08,132 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 -> 6cc35d6f5b3d5004e97f7480a41f6aacae9190a53086f4ffe9263637987416cc [2024-10-14 11:07:08,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:07:08,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:07:08,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:07:08,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:07:08,515 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:07:08,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-14 11:07:10,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:07:10,425 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:07:10,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-14 11:07:10,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/302bf02cd/54098bdeda7f4f47bf8dde798961dd90/FLAG858fbbac3 [2024-10-14 11:07:10,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/302bf02cd/54098bdeda7f4f47bf8dde798961dd90 [2024-10-14 11:07:10,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:07:10,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:07:10,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:07:10,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:07:10,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:07:10,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:07:10" (1/1) ... [2024-10-14 11:07:10,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9d3e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:10, skipping insertion in model container [2024-10-14 11:07:10,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:07:10" (1/1) ... [2024-10-14 11:07:10,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:07:10,998 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-10-14 11:07:11,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:07:11,079 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:07:11,097 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-70.i[916,929] [2024-10-14 11:07:11,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:07:11,141 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:07:11,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11 WrapperNode [2024-10-14 11:07:11,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:07:11,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:07:11,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:07:11,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:07:11,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,190 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-10-14 11:07:11,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:07:11,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:07:11,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:07:11,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:07:11,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,224 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:07:11,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:07:11,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:07:11,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:07:11,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:07:11,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (1/1) ... [2024-10-14 11:07:11,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:07:11,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:07:11,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:07:11,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:07:11,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:07:11,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:07:11,362 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:07:11,362 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:07:11,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:07:11,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:07:11,440 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:07:11,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:07:11,723 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 11:07:11,723 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:07:11,809 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:07:11,810 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:07:11,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:11 BoogieIcfgContainer [2024-10-14 11:07:11,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:07:11,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:07:11,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:07:11,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:07:11,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:07:10" (1/3) ... [2024-10-14 11:07:11,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2021bb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:07:11, skipping insertion in model container [2024-10-14 11:07:11,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:11" (2/3) ... [2024-10-14 11:07:11,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2021bb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:07:11, skipping insertion in model container [2024-10-14 11:07:11,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:11" (3/3) ... [2024-10-14 11:07:11,822 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-70.i [2024-10-14 11:07:11,840 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:07:11,840 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:07:11,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:07:11,926 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;@7ed54c45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:07:11,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:07:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 11:07:11,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 11:07:11,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:11,945 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:11,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:11,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash 597887913, now seen corresponding path program 1 times [2024-10-14 11:07:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:07:11,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298795003] [2024-10-14 11:07:11,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:07:11,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:07:11,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:07:11,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 11:07:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:12,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:07:12,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:07:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-14 11:07:12,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:07:12,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:07:12,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298795003] [2024-10-14 11:07:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298795003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:12,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:12,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:07:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381187753] [2024-10-14 11:07:12,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:12,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:07:12,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:07:12,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:07:12,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:07:12,200 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:12,262 INFO L93 Difference]: Finished difference Result 83 states and 144 transitions. [2024-10-14 11:07:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:07:12,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-14 11:07:12,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:12,277 INFO L225 Difference]: With dead ends: 83 [2024-10-14 11:07:12,277 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 11:07:12,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:07:12,286 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:12,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:07:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 11:07:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 11:07:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 11:07:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-14 11:07:12,336 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 99 [2024-10-14 11:07:12,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:12,337 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-14 11:07:12,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 11:07:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-14 11:07:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 11:07:12,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:12,345 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:12,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 11:07:12,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:07:12,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:12,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash -474354775, now seen corresponding path program 1 times [2024-10-14 11:07:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:07:12,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111547345] [2024-10-14 11:07:12,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:12,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:07:12,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:07:12,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:07:12,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 11:07:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:12,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 11:07:12,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:07:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 138 proven. 72 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-14 11:07:13,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:07:13,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:07:13,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111547345] [2024-10-14 11:07:13,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111547345] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:07:13,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1475396834] [2024-10-14 11:07:13,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:13,577 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 11:07:13,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 11:07:13,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 11:07:13,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-14 11:07:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:13,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-14 11:07:13,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:07:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 138 proven. 72 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-14 11:07:14,364 INFO L311 TraceCheckSpWp]: Computing backward predicates...