./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.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 e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:40:29,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:40:29,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:40:29,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:40:29,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:40:29,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:40:29,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:40:29,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:40:29,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:40:29,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:40:29,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:40:29,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:40:29,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:40:29,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:40:29,500 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:40:29,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:40:29,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:40:29,501 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:40:29,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:40:29,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:40:29,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:40:29,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:40:29,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:40:29,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:40:29,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:40:29,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:40:29,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:40:29,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:40:29,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:40:29,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:40:29,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:40:29,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:40:29,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:40:29,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:40:29,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:40:29,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:40:29,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:40:29,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:40:29,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:40:29,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:40:29,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:40:29,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:40:29,512 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 -> e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 [2024-10-24 10:40:29,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:40:29,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:40:29,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:40:29,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:40:29,811 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:40:29,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-10-24 10:40:31,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:40:31,436 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:40:31,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-10-24 10:40:31,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/938cf15bf/64ed1345d33449c498b9fd93d7fd39b1/FLAG1234ab740 [2024-10-24 10:40:31,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/938cf15bf/64ed1345d33449c498b9fd93d7fd39b1 [2024-10-24 10:40:31,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:40:31,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:40:31,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:31,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:40:31,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:40:31,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2637c2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31, skipping insertion in model container [2024-10-24 10:40:31,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:40:31,675 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i[915,928] [2024-10-24 10:40:31,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:31,752 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:40:31,765 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i[915,928] [2024-10-24 10:40:31,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:31,818 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:40:31,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31 WrapperNode [2024-10-24 10:40:31,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:31,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:31,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:40:31,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:40:31,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,881 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-24 10:40:31,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:31,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:40:31,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:40:31,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:40:31,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,924 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:40:31,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:40:31,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:40:31,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:40:31,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:40:31,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:40:31,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:40:31,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:40:31,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:40:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:40:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:40:32,012 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:40:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:40:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:40:32,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:40:32,078 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:40:32,080 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:40:32,319 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 10:40:32,319 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:40:32,359 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:40:32,359 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:40:32,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:32 BoogieIcfgContainer [2024-10-24 10:40:32,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:40:32,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:40:32,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:40:32,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:40:32,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:40:31" (1/3) ... [2024-10-24 10:40:32,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3524c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:32, skipping insertion in model container [2024-10-24 10:40:32,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31" (2/3) ... [2024-10-24 10:40:32,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3524c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:32, skipping insertion in model container [2024-10-24 10:40:32,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:32" (3/3) ... [2024-10-24 10:40:32,369 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-87.i [2024-10-24 10:40:32,381 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:40:32,382 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:40:32,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:40:32,440 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;@30b04bc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:40:32,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:40:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:40:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 10:40:32,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:32,453 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:32,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:32,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:32,458 INFO L85 PathProgramCache]: Analyzing trace with hash 697213815, now seen corresponding path program 1 times [2024-10-24 10:40:32,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:32,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515860147] [2024-10-24 10:40:32,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:32,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:40:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:40:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:40:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:40:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:40:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:40:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:40:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:40:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:40:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:40:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:40:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:40:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:40:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:40:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:40:32,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:40:32,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515860147] [2024-10-24 10:40:32,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515860147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:32,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:32,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:40:32,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851844970] [2024-10-24 10:40:32,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:32,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:40:32,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:40:32,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:40:32,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:40:32,834 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 10:40:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:32,874 INFO L93 Difference]: Finished difference Result 99 states and 166 transitions. [2024-10-24 10:40:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:40:32,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-10-24 10:40:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:32,887 INFO L225 Difference]: With dead ends: 99 [2024-10-24 10:40:32,887 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 10:40:32,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:40:32,895 INFO L432 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:32,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:40:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 10:40:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-24 10:40:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:40:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2024-10-24 10:40:32,958 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 92 [2024-10-24 10:40:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:32,958 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2024-10-24 10:40:32,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 10:40:32,958 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2024-10-24 10:40:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 10:40:32,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:32,986 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:32,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:40:32,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:32,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:32,990 INFO L85 PathProgramCache]: Analyzing trace with hash -146751621, now seen corresponding path program 1 times [2024-10-24 10:40:32,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:32,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105688651] [2024-10-24 10:40:32,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:32,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:40:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:40:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:40:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:40:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:40:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:40:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:40:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:40:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:40:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:40:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:40:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:40:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:40:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:40:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:40:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:40:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105688651] [2024-10-24 10:40:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105688651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:38,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:38,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:40:38,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051374237] [2024-10-24 10:40:38,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:38,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:40:38,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:40:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:40:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:40:38,747 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:40:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:38,938 INFO L93 Difference]: Finished difference Result 116 states and 169 transitions. [2024-10-24 10:40:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:40:38,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-10-24 10:40:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:38,945 INFO L225 Difference]: With dead ends: 116 [2024-10-24 10:40:38,945 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 10:40:38,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:40:38,948 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:38,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 243 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:40:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 10:40:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-10-24 10:40:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:40:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-10-24 10:40:38,966 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 92 [2024-10-24 10:40:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:38,967 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-10-24 10:40:38,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:40:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-10-24 10:40:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 10:40:38,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:38,970 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:38,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:40:38,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:38,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash -383632671, now seen corresponding path program 1 times [2024-10-24 10:40:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:38,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470541799] [2024-10-24 10:40:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:38,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:40:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:40:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:40:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:40:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:40:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:40:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:40:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:40:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:40:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:40:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:40:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:40:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:40:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:40:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:40:51,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:40:51,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470541799] [2024-10-24 10:40:51,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470541799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:51,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:51,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:40:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959172692] [2024-10-24 10:40:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:51,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:40:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:40:51,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:40:51,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:40:51,194 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:40:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:52,079 INFO L93 Difference]: Finished difference Result 193 states and 277 transitions. [2024-10-24 10:40:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:40:52,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-24 10:40:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:52,086 INFO L225 Difference]: With dead ends: 193 [2024-10-24 10:40:52,087 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 10:40:52,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:40:52,089 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 118 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:52,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 305 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 10:40:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 10:40:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 64. [2024-10-24 10:40:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:40:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-10-24 10:40:52,103 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 93 [2024-10-24 10:40:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:52,104 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-10-24 10:40:52,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:40:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-10-24 10:40:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 10:40:52,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:52,106 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:52,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:40:52,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:52,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash 317431907, now seen corresponding path program 1 times [2024-10-24 10:40:52,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:52,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742487235] [2024-10-24 10:40:52,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:52,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:40:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:40:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:40:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:40:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:40:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:40:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:40:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:40:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:40:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:40:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:40:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:40:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:40:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:40:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:40:52,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:40:52,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742487235] [2024-10-24 10:40:52,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742487235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:52,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:52,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:40:52,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906322417] [2024-10-24 10:40:52,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:52,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:40:52,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:40:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:40:52,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:40:52,455 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:40:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:52,718 INFO L93 Difference]: Finished difference Result 187 states and 269 transitions. [2024-10-24 10:40:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:40:52,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-24 10:40:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:52,720 INFO L225 Difference]: With dead ends: 187 [2024-10-24 10:40:52,721 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 10:40:52,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:40:52,722 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 64 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:52,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 316 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:40:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 10:40:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2024-10-24 10:40:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:40:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-10-24 10:40:52,738 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 93 [2024-10-24 10:40:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:52,738 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-10-24 10:40:52,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:40:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-10-24 10:40:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 10:40:52,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:52,743 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:52,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:40:52,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:52,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1394749921, now seen corresponding path program 1 times [2024-10-24 10:40:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:52,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054935368] [2024-10-24 10:40:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:52,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:40:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:40:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:40:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:40:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:40:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:40:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:40:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:40:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:40:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:40:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:40:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:40:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:40:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:40:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:40:54,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:40:54,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054935368] [2024-10-24 10:40:54,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054935368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:54,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:54,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:40:54,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526943051] [2024-10-24 10:40:54,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:54,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:40:54,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:40:54,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:40:54,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:40:54,951 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:40:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:55,306 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2024-10-24 10:40:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:40:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-24 10:40:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:55,311 INFO L225 Difference]: With dead ends: 304 [2024-10-24 10:40:55,311 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 10:40:55,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:40:55,317 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 94 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:55,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 301 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:40:55,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 10:40:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 169. [2024-10-24 10:40:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 132 states have (on average 1.393939393939394) internal successors, (184), 134 states have internal predecessors, (184), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 10:40:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 248 transitions. [2024-10-24 10:40:55,354 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 248 transitions. Word has length 93 [2024-10-24 10:40:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:55,355 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 248 transitions. [2024-10-24 10:40:55,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:40:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 248 transitions. [2024-10-24 10:40:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 10:40:55,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:55,357 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:55,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:40:55,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash -693685343, now seen corresponding path program 1 times [2024-10-24 10:40:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:55,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439612021] [2024-10-24 10:40:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:40:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:40:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:40:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:40:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:40:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:40:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:40:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:40:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:40:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:40:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:40:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:40:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:40:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:40:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:40:55,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:40:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439612021] [2024-10-24 10:40:55,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439612021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:55,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:55,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:40:55,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777287453] [2024-10-24 10:40:55,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:55,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:40:55,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:40:55,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:40:55,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:40:55,539 INFO L87 Difference]: Start difference. First operand 169 states and 248 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:40:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:55,632 INFO L93 Difference]: Finished difference Result 322 states and 472 transitions. [2024-10-24 10:40:55,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:40:55,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-24 10:40:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:55,634 INFO L225 Difference]: With dead ends: 322 [2024-10-24 10:40:55,634 INFO L226 Difference]: Without dead ends: 161 [2024-10-24 10:40:55,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:40:55,636 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:55,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 298 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:40:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-24 10:40:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-10-24 10:40:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 124 states have internal predecessors, (167), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 10:40:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 231 transitions. [2024-10-24 10:40:55,656 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 231 transitions. Word has length 93 [2024-10-24 10:40:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:55,656 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 231 transitions. [2024-10-24 10:40:55,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:40:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 231 transitions. [2024-10-24 10:40:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 10:40:55,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:55,658 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:55,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 10:40:55,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:55,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash 354462304, now seen corresponding path program 1 times [2024-10-24 10:40:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:55,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742403480] [2024-10-24 10:40:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:41:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:41:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:41:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:41:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:41:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:41:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:41:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:41:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:41:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:41:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:41:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:41:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:41:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:41:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:41:01,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:41:01,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742403480] [2024-10-24 10:41:01,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742403480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:41:01,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:41:01,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 10:41:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485223162] [2024-10-24 10:41:01,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:41:01,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 10:41:01,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:41:01,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 10:41:01,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:41:01,209 INFO L87 Difference]: Start difference. First operand 159 states and 231 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:41:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:41:02,737 INFO L93 Difference]: Finished difference Result 243 states and 342 transitions. [2024-10-24 10:41:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 10:41:02,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-24 10:41:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:41:02,741 INFO L225 Difference]: With dead ends: 243 [2024-10-24 10:41:02,741 INFO L226 Difference]: Without dead ends: 241 [2024-10-24 10:41:02,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 10:41:02,744 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 27 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 10:41:02,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 317 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 10:41:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-24 10:41:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 233. [2024-10-24 10:41:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 188 states have internal predecessors, (243), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 10:41:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 327 transitions. [2024-10-24 10:41:02,783 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 327 transitions. Word has length 94 [2024-10-24 10:41:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:41:02,784 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 327 transitions. [2024-10-24 10:41:02,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:41:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 327 transitions. [2024-10-24 10:41:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 10:41:02,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:41:02,785 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:41:02,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 10:41:02,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:41:02,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:41:02,786 INFO L85 PathProgramCache]: Analyzing trace with hash 91929880, now seen corresponding path program 1 times [2024-10-24 10:41:02,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:41:02,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538540420] [2024-10-24 10:41:02,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:41:02,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:41:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:41:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:41:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:41:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:41:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:41:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:41:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:41:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:41:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:41:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:41:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:41:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:41:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:41:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:41:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:41:10,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:41:10,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538540420] [2024-10-24 10:41:10,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538540420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:41:10,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:41:10,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:41:10,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924269929] [2024-10-24 10:41:10,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:41:10,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:41:10,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:41:10,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:41:10,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:41:10,321 INFO L87 Difference]: Start difference. First operand 233 states and 327 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:41:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:41:11,094 INFO L93 Difference]: Finished difference Result 419 states and 584 transitions. [2024-10-24 10:41:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:41:11,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-24 10:41:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:41:11,099 INFO L225 Difference]: With dead ends: 419 [2024-10-24 10:41:11,099 INFO L226 Difference]: Without dead ends: 264 [2024-10-24 10:41:11,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:41:11,100 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 48 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:41:11,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 310 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 10:41:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-24 10:41:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 223. [2024-10-24 10:41:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 178 states have internal predecessors, (227), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 10:41:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 311 transitions. [2024-10-24 10:41:11,142 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 311 transitions. Word has length 94 [2024-10-24 10:41:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:41:11,144 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 311 transitions. [2024-10-24 10:41:11,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:41:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 311 transitions. [2024-10-24 10:41:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 10:41:11,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:41:11,146 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:41:11,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 10:41:11,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:41:11,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:41:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash 350095318, now seen corresponding path program 1 times [2024-10-24 10:41:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:41:11,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406629933] [2024-10-24 10:41:11,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:41:11,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:41:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:41:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:41:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:41:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:41:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:41:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:41:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:41:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:41:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:41:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:41:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:41:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:41:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:41:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:41:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:41:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:41:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406629933] [2024-10-24 10:41:15,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406629933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:41:15,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:41:15,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:41:15,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10221204] [2024-10-24 10:41:15,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:41:15,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:41:15,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:41:15,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:41:15,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:41:15,528 INFO L87 Difference]: Start difference. First operand 223 states and 311 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:41:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:41:16,163 INFO L93 Difference]: Finished difference Result 378 states and 523 transitions. [2024-10-24 10:41:16,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:41:16,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-24 10:41:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:41:16,167 INFO L225 Difference]: With dead ends: 378 [2024-10-24 10:41:16,167 INFO L226 Difference]: Without dead ends: 233 [2024-10-24 10:41:16,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:41:16,168 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 45 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:41:16,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 323 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:41:16,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-24 10:41:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 223. [2024-10-24 10:41:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 173 states have (on average 1.30635838150289) internal successors, (226), 178 states have internal predecessors, (226), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 10:41:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 310 transitions. [2024-10-24 10:41:16,201 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 310 transitions. Word has length 94 [2024-10-24 10:41:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:41:16,202 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 310 transitions. [2024-10-24 10:41:16,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:41:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 310 transitions. [2024-10-24 10:41:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 10:41:16,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:41:16,203 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:41:16,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 10:41:16,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:41:16,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:41:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1608059649, now seen corresponding path program 1 times [2024-10-24 10:41:16,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:41:16,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686860326] [2024-10-24 10:41:16,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:41:16,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:41:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 10:41:16,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [874349501] [2024-10-24 10:41:16,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:41:16,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:41:16,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:41:16,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:41:16,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 10:41:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:41:16,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:41:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:41:16,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:41:16,455 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:41:16,456 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:41:16,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 10:41:16,661 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,SelfDestructingSolverStorable9 [2024-10-24 10:41:16,665 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:41:16,734 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:41:16,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:41:16 BoogieIcfgContainer [2024-10-24 10:41:16,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:41:16,737 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:41:16,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:41:16,738 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:41:16,738 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:32" (3/4) ... [2024-10-24 10:41:16,740 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:41:16,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:41:16,741 INFO L158 Benchmark]: Toolchain (without parser) took 45276.27ms. Allocated memory was 134.2MB in the beginning and 1.0GB in the end (delta: 882.9MB). Free memory was 63.5MB in the beginning and 934.4MB in the end (delta: -870.9MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-10-24 10:41:16,741 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:41:16,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.41ms. Allocated memory is still 134.2MB. Free memory was 63.2MB in the beginning and 49.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:41:16,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.27ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 49.4MB in the beginning and 159.8MB in the end (delta: -110.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-24 10:41:16,742 INFO L158 Benchmark]: Boogie Preprocessor took 54.22ms. Allocated memory is still 188.7MB. Free memory was 159.8MB in the beginning and 158.5MB in the end (delta: 1.3MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-24 10:41:16,743 INFO L158 Benchmark]: RCFGBuilder took 419.15ms. Allocated memory is still 188.7MB. Free memory was 158.5MB in the beginning and 139.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 10:41:16,743 INFO L158 Benchmark]: TraceAbstraction took 44374.70ms. Allocated memory was 188.7MB in the beginning and 1.0GB in the end (delta: 828.4MB). Free memory was 138.6MB in the beginning and 934.4MB in the end (delta: -795.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-10-24 10:41:16,743 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 1.0GB. Free memory is still 934.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:41:16,744 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 134.2MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.41ms. Allocated memory is still 134.2MB. Free memory was 63.2MB in the beginning and 49.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.27ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 49.4MB in the beginning and 159.8MB in the end (delta: -110.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.22ms. Allocated memory is still 188.7MB. Free memory was 159.8MB in the beginning and 158.5MB in the end (delta: 1.3MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * RCFGBuilder took 419.15ms. Allocated memory is still 188.7MB. Free memory was 158.5MB in the beginning and 139.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 44374.70ms. Allocated memory was 188.7MB in the beginning and 1.0GB in the end (delta: 828.4MB). Free memory was 138.6MB in the beginning and 934.4MB in the end (delta: -795.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 1.0GB. Free memory is still 934.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 3164414017; [L25] unsigned long int var_1_4 = 128; [L26] signed char var_1_5 = -128; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 50; [L29] float var_1_8 = 5.1; [L30] float var_1_9 = 63.75; [L31] signed char var_1_10 = 100; [L32] signed long int var_1_12 = 5; [L33] signed char last_1_var_1_10 = 100; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 [L100] RET updateLastVariables() [L101] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L70] var_1_3 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L71] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L73] var_1_4 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L76] var_1_6 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_6 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L77] RET assume_abort_if_not(var_1_6 >= -126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L79] var_1_7 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L80] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L82] var_1_9 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L83] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L84] var_1_12 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L85] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L86] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L86] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L87] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L87] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L101] RET updateVariables() [L102] CALL step() [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L40] signed long int stepLocal_1 = -8; [L41] unsigned long int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_1=-8, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L42] COND FALSE !(stepLocal_1 < var_1_4) [L49] var_1_5 = -2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L51] unsigned long int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L52] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L52] unsigned long int stepLocal_2 = var_1_4 >> var_1_3; [L53] COND TRUE var_1_6 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L54] COND TRUE var_1_6 != stepLocal_3 [L55] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L58] COND FALSE !((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93-L94] return (((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1)) && (((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) ? ((var_1_7 >= last_1_var_1_10) ? (var_1_10 == ((signed char) -32)) : (var_1_10 == ((signed char) var_1_7))) : 1) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=-2147483649, var_1_4=0, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 488 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 488 mSDsluCounter, 2482 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1846 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1532 IncrementalHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 636 mSDtfsCounter, 1532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 189 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 38.0s InterpolantComputationTime, 1028 NumberOfCodeBlocks, 1028 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 10268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3276/3276 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:41:16,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.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 e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:41:18,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:41:19,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:41:19,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:41:19,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:41:19,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:41:19,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:41:19,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:41:19,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:41:19,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:41:19,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:41:19,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:41:19,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:41:19,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:41:19,071 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:41:19,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:41:19,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:41:19,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:41:19,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:41:19,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:41:19,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:41:19,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:41:19,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:41:19,075 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:41:19,075 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:41:19,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:41:19,075 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:41:19,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:41:19,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:41:19,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:41:19,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:41:19,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:41:19,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:41:19,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:41:19,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:41:19,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:41:19,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:41:19,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:41:19,078 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:41:19,078 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:41:19,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:41:19,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:41:19,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:41:19,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:41:19,081 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:41:19,081 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 -> e3da299f1752ee08576ff67ebc19be30d3a209c67fcfa6061ee76b74742c8873 [2024-10-24 10:41:19,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:41:19,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:41:19,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:41:19,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:41:19,410 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:41:19,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-10-24 10:41:20,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:41:21,087 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:41:21,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i [2024-10-24 10:41:21,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31404fbad/8555ffd338c84985808635ecbc0a6ade/FLAGaea426b52 [2024-10-24 10:41:21,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31404fbad/8555ffd338c84985808635ecbc0a6ade [2024-10-24 10:41:21,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:41:21,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:41:21,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:41:21,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:41:21,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:41:21,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4636306f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21, skipping insertion in model container [2024-10-24 10:41:21,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:41:21,333 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i[915,928] [2024-10-24 10:41:21,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:41:21,414 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:41:21,427 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-87.i[915,928] [2024-10-24 10:41:21,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:41:21,499 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:41:21,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21 WrapperNode [2024-10-24 10:41:21,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:41:21,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:41:21,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:41:21,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:41:21,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,554 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-10-24 10:41:21,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:41:21,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:41:21,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:41:21,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:41:21,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,581 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:41:21,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:41:21,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:41:21,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:41:21,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:41:21,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (1/1) ... [2024-10-24 10:41:21,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:41:21,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:41:21,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:41:21,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:41:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:41:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:41:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:41:21,697 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:41:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:41:21,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:41:21,768 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:41:21,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:41:22,108 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 10:41:22,109 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:41:22,176 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:41:22,176 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:41:22,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:41:22 BoogieIcfgContainer [2024-10-24 10:41:22,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:41:22,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:41:22,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:41:22,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:41:22,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:41:21" (1/3) ... [2024-10-24 10:41:22,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6d276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:41:22, skipping insertion in model container [2024-10-24 10:41:22,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:21" (2/3) ... [2024-10-24 10:41:22,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6d276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:41:22, skipping insertion in model container [2024-10-24 10:41:22,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:41:22" (3/3) ... [2024-10-24 10:41:22,187 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-87.i [2024-10-24 10:41:22,202 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:41:22,203 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:41:22,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:41:22,259 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;@5f155724, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:41:22,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:41:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:41:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 10:41:22,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:41:22,271 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:41:22,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:41:22,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:41:22,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1783494206, now seen corresponding path program 1 times [2024-10-24 10:41:22,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:41:22,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567187859] [2024-10-24 10:41:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:41:22,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:41:22,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:41:22,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:41:22,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 10:41:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:22,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:41:22,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:41:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-24 10:41:22,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:41:22,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:41:22,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567187859] [2024-10-24 10:41:22,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567187859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:41:22,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:41:22,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:41:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770246790] [2024-10-24 10:41:22,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:41:22,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:41:22,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:41:22,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:41:22,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:41:22,589 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 10:41:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:41:22,656 INFO L93 Difference]: Finished difference Result 83 states and 144 transitions. [2024-10-24 10:41:22,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:41:22,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-24 10:41:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:41:22,667 INFO L225 Difference]: With dead ends: 83 [2024-10-24 10:41:22,668 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 10:41:22,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:41:22,674 INFO L432 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:41:22,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:41:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 10:41:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-24 10:41:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:41:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2024-10-24 10:41:22,710 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 88 [2024-10-24 10:41:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:41:22,710 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2024-10-24 10:41:22,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 10:41:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2024-10-24 10:41:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 10:41:22,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:41:22,714 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:41:22,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 10:41:22,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:41:22,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:41:22,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:41:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash 834324422, now seen corresponding path program 1 times [2024-10-24 10:41:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:41:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003908691] [2024-10-24 10:41:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:41:22,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:41:22,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:41:22,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:41:22,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 10:41:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:23,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 10:41:23,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:41:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 54 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 10:41:23,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:41:23,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:41:23,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003908691] [2024-10-24 10:41:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003908691] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:41:23,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1349248025] [2024-10-24 10:41:23,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:41:23,752 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 10:41:23,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 10:41:23,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 10:41:23,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 10:41:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:24,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 10:41:24,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:41:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 54 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 10:41:24,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:41:24,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1349248025] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:41:24,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 10:41:24,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2024-10-24 10:41:24,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970236663] [2024-10-24 10:41:24,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 10:41:24,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 10:41:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:41:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 10:41:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:41:24,467 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 10:41:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:41:24,835 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2024-10-24 10:41:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 10:41:24,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 88 [2024-10-24 10:41:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:41:24,840 INFO L225 Difference]: With dead ends: 93 [2024-10-24 10:41:24,840 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 10:41:24,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-10-24 10:41:24,842 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 42 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:41:24,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 110 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:41:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 10:41:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-10-24 10:41:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:41:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2024-10-24 10:41:24,853 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 88 [2024-10-24 10:41:24,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:41:24,854 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2024-10-24 10:41:24,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 10:41:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2024-10-24 10:41:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 10:41:24,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:41:24,856 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:41:24,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-24 10:41:25,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 10:41:25,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:41:25,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:41:25,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:41:25,258 INFO L85 PathProgramCache]: Analyzing trace with hash -150455707, now seen corresponding path program 1 times [2024-10-24 10:41:25,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:41:25,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71463313] [2024-10-24 10:41:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:41:25,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:41:25,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:41:25,263 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:41:25,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 10:41:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:41:25,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 10:41:25,385 INFO L278 TraceCheckSpWp]: Computing forward predicates...