./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_amount10_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.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 e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:28:01,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:28:01,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:28:01,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:28:01,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:28:01,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:28:01,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:28:01,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:28:01,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:28:01,311 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:28:01,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:28:01,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:28:01,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:28:01,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:28:01,315 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:28:01,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:28:01,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:28:01,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:28:01,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:28:01,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:28:01,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:28:01,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:28:01,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:28:01,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:28:01,321 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:28:01,321 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:28:01,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:28:01,321 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:28:01,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:28:01,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:28:01,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:28:01,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:28:01,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:28:01,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:28:01,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:28:01,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:28:01,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:28:01,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:28:01,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:28:01,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:28:01,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:28:01,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:28:01,326 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 -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2024-10-14 12:28:01,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:28:01,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:28:01,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:28:01,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:28:01,685 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:28:01,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-14 12:28:03,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:28:03,492 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:28:03,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-14 12:28:03,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c1e57bf/339bcd264923405c88f4fc5a5bc77eeb/FLAG6c3e9a99e [2024-10-14 12:28:03,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c1e57bf/339bcd264923405c88f4fc5a5bc77eeb [2024-10-14 12:28:03,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:28:03,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:28:03,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:28:03,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:28:03,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:28:03,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a596fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03, skipping insertion in model container [2024-10-14 12:28:03,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:28:03,715 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_amount10_file-60.i[915,928] [2024-10-14 12:28:03,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:28:03,767 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:28:03,777 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_amount10_file-60.i[915,928] [2024-10-14 12:28:03,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:28:03,813 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:28:03,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03 WrapperNode [2024-10-14 12:28:03,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:28:03,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:28:03,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:28:03,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:28:03,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,858 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-14 12:28:03,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:28:03,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:28:03,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:28:03,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:28:03,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,897 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 12:28:03,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:28:03,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:28:03,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:28:03,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:28:03,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (1/1) ... [2024-10-14 12:28:03,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:28:03,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:28:03,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:28:03,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:28:04,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:28:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:28:04,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:28:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:28:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:28:04,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:28:04,143 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:28:04,151 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:28:04,465 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 12:28:04,466 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:28:04,494 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:28:04,495 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:28:04,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:04 BoogieIcfgContainer [2024-10-14 12:28:04,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:28:04,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:28:04,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:28:04,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:28:04,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:28:03" (1/3) ... [2024-10-14 12:28:04,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbe9190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:28:04, skipping insertion in model container [2024-10-14 12:28:04,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:03" (2/3) ... [2024-10-14 12:28:04,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbe9190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:28:04, skipping insertion in model container [2024-10-14 12:28:04,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:04" (3/3) ... [2024-10-14 12:28:04,511 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2024-10-14 12:28:04,526 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:28:04,526 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:28:04,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:28:04,617 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;@438ecb3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:28:04,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:28:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 12:28:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 12:28:04,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:04,633 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:04,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:04,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:04,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1377890462, now seen corresponding path program 1 times [2024-10-14 12:28:04,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:04,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814215253] [2024-10-14 12:28:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:04,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:04,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814215253] [2024-10-14 12:28:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814215253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:04,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:04,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:28:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179665732] [2024-10-14 12:28:04,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:04,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:28:04,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:04,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:28:04,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:28:04,975 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 12:28:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:05,016 INFO L93 Difference]: Finished difference Result 87 states and 146 transitions. [2024-10-14 12:28:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:28:05,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-10-14 12:28:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:05,026 INFO L225 Difference]: With dead ends: 87 [2024-10-14 12:28:05,026 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 12:28:05,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:28:05,036 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-14 12:28:05,038 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-14 12:28:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 12:28:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-14 12:28:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 12:28:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2024-10-14 12:28:05,082 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 77 [2024-10-14 12:28:05,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:05,082 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2024-10-14 12:28:05,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 12:28:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2024-10-14 12:28:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 12:28:05,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:05,087 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:05,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:28:05,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:05,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash 255276898, now seen corresponding path program 1 times [2024-10-14 12:28:05,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:05,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072775830] [2024-10-14 12:28:05,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:05,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:05,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:05,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:05,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:05,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:05,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:05,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:05,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:05,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:05,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:05,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:06,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:06,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072775830] [2024-10-14 12:28:06,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072775830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:06,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:06,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:28:06,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284712264] [2024-10-14 12:28:06,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:06,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:28:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:06,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:28:06,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:28:06,017 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:06,305 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2024-10-14 12:28:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:28:06,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-14 12:28:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:06,309 INFO L225 Difference]: With dead ends: 104 [2024-10-14 12:28:06,309 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 12:28:06,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:28:06,312 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 20 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:06,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 12:28:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 12:28:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2024-10-14 12:28:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 12:28:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-10-14 12:28:06,331 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 77 [2024-10-14 12:28:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:06,334 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-10-14 12:28:06,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-10-14 12:28:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 12:28:06,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:06,340 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:06,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:28:06,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:06,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:06,341 INFO L85 PathProgramCache]: Analyzing trace with hash 935335268, now seen corresponding path program 1 times [2024-10-14 12:28:06,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:06,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846670534] [2024-10-14 12:28:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:06,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:06,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:06,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846670534] [2024-10-14 12:28:06,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846670534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:06,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:06,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:28:06,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583535081] [2024-10-14 12:28:06,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:06,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:28:06,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:06,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:28:06,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:28:06,568 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:06,646 INFO L93 Difference]: Finished difference Result 143 states and 203 transitions. [2024-10-14 12:28:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:28:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-14 12:28:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:06,650 INFO L225 Difference]: With dead ends: 143 [2024-10-14 12:28:06,650 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 12:28:06,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:28:06,654 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:06,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 115 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:28:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 12:28:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-14 12:28:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 12:28:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 127 transitions. [2024-10-14 12:28:06,686 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 127 transitions. Word has length 77 [2024-10-14 12:28:06,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:06,687 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 127 transitions. [2024-10-14 12:28:06,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 127 transitions. [2024-10-14 12:28:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 12:28:06,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:06,691 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:06,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:28:06,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:06,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:06,692 INFO L85 PathProgramCache]: Analyzing trace with hash -135947097, now seen corresponding path program 1 times [2024-10-14 12:28:06,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:06,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127617559] [2024-10-14 12:28:06,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:06,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:07,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127617559] [2024-10-14 12:28:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127617559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:07,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:07,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 12:28:07,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110810746] [2024-10-14 12:28:07,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:07,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 12:28:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:07,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 12:28:07,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 12:28:07,795 INFO L87 Difference]: Start difference. First operand 91 states and 127 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:08,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:08,435 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2024-10-14 12:28:08,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 12:28:08,437 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-14 12:28:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:08,439 INFO L225 Difference]: With dead ends: 148 [2024-10-14 12:28:08,439 INFO L226 Difference]: Without dead ends: 146 [2024-10-14 12:28:08,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-14 12:28:08,441 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 118 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:08,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 295 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:28:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-14 12:28:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2024-10-14 12:28:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 89 states have internal predecessors, (109), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 12:28:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 169 transitions. [2024-10-14 12:28:08,466 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 169 transitions. Word has length 79 [2024-10-14 12:28:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:08,466 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 169 transitions. [2024-10-14 12:28:08,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 169 transitions. [2024-10-14 12:28:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 12:28:08,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:08,469 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:08,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:28:08,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:08,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash -945293723, now seen corresponding path program 1 times [2024-10-14 12:28:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:08,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550900588] [2024-10-14 12:28:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:09,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:09,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550900588] [2024-10-14 12:28:09,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550900588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:09,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:09,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 12:28:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053067238] [2024-10-14 12:28:09,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:09,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 12:28:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:09,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 12:28:09,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 12:28:09,267 INFO L87 Difference]: Start difference. First operand 122 states and 169 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:10,079 INFO L93 Difference]: Finished difference Result 159 states and 212 transitions. [2024-10-14 12:28:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 12:28:10,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-14 12:28:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:10,082 INFO L225 Difference]: With dead ends: 159 [2024-10-14 12:28:10,082 INFO L226 Difference]: Without dead ends: 157 [2024-10-14 12:28:10,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-14 12:28:10,084 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 76 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:10,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 482 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 12:28:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-14 12:28:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125. [2024-10-14 12:28:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 92 states have internal predecessors, (113), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 12:28:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2024-10-14 12:28:10,121 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 79 [2024-10-14 12:28:10,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:10,122 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2024-10-14 12:28:10,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2024-10-14 12:28:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 12:28:10,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:10,128 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:10,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 12:28:10,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:10,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:10,129 INFO L85 PathProgramCache]: Analyzing trace with hash 806892677, now seen corresponding path program 1 times [2024-10-14 12:28:10,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:10,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665977814] [2024-10-14 12:28:10,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:10,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:10,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665977814] [2024-10-14 12:28:10,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665977814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:10,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:10,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:28:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339419] [2024-10-14 12:28:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:10,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:28:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:28:10,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:28:10,210 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:10,281 INFO L93 Difference]: Finished difference Result 259 states and 361 transitions. [2024-10-14 12:28:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:28:10,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-10-14 12:28:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:10,286 INFO L225 Difference]: With dead ends: 259 [2024-10-14 12:28:10,286 INFO L226 Difference]: Without dead ends: 175 [2024-10-14 12:28:10,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:28:10,288 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 45 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:10,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 139 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:28:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-14 12:28:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2024-10-14 12:28:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 116 states have (on average 1.206896551724138) internal successors, (140), 118 states have internal predecessors, (140), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 12:28:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 236 transitions. [2024-10-14 12:28:10,320 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 236 transitions. Word has length 80 [2024-10-14 12:28:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:10,321 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 236 transitions. [2024-10-14 12:28:10,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 236 transitions. [2024-10-14 12:28:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 12:28:10,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:10,322 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:10,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 12:28:10,322 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:10,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:10,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1243156778, now seen corresponding path program 1 times [2024-10-14 12:28:10,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:10,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411727037] [2024-10-14 12:28:10,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:10,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:10,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:10,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411727037] [2024-10-14 12:28:10,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411727037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:10,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:10,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:28:10,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126366129] [2024-10-14 12:28:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:10,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:28:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:10,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:28:10,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:28:10,398 INFO L87 Difference]: Start difference. First operand 170 states and 236 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:10,454 INFO L93 Difference]: Finished difference Result 298 states and 413 transitions. [2024-10-14 12:28:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:28:10,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-10-14 12:28:10,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:10,457 INFO L225 Difference]: With dead ends: 298 [2024-10-14 12:28:10,457 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 12:28:10,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:28:10,459 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 52 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:10,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 102 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:28:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 12:28:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-10-14 12:28:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.176991150442478) internal successors, (133), 115 states have internal predecessors, (133), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 12:28:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 229 transitions. [2024-10-14 12:28:10,505 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 229 transitions. Word has length 80 [2024-10-14 12:28:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:10,505 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 229 transitions. [2024-10-14 12:28:10,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 229 transitions. [2024-10-14 12:28:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 12:28:10,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:10,508 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:10,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 12:28:10,509 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:10,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:10,509 INFO L85 PathProgramCache]: Analyzing trace with hash 854969490, now seen corresponding path program 1 times [2024-10-14 12:28:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:10,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156607277] [2024-10-14 12:28:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:10,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:10,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:10,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156607277] [2024-10-14 12:28:10,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156607277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:10,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:10,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:28:10,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333779337] [2024-10-14 12:28:10,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:10,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:28:10,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:10,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:28:10,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:28:10,670 INFO L87 Difference]: Start difference. First operand 167 states and 229 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:10,747 INFO L93 Difference]: Finished difference Result 335 states and 458 transitions. [2024-10-14 12:28:10,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:28:10,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-10-14 12:28:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:10,750 INFO L225 Difference]: With dead ends: 335 [2024-10-14 12:28:10,750 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 12:28:10,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:28:10,751 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 17 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:10,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 199 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:28:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 12:28:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-10-14 12:28:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.1504424778761062) internal successors, (130), 115 states have internal predecessors, (130), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 12:28:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 226 transitions. [2024-10-14 12:28:10,780 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 226 transitions. Word has length 80 [2024-10-14 12:28:10,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:10,780 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 226 transitions. [2024-10-14 12:28:10,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 226 transitions. [2024-10-14 12:28:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 12:28:10,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:10,782 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:10,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 12:28:10,783 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:10,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:10,783 INFO L85 PathProgramCache]: Analyzing trace with hash 163072564, now seen corresponding path program 1 times [2024-10-14 12:28:10,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:10,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322925419] [2024-10-14 12:28:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:10,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:10,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:10,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322925419] [2024-10-14 12:28:10,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322925419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:10,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:10,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:28:10,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443876099] [2024-10-14 12:28:10,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:10,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:28:10,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:10,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:28:10,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:28:10,923 INFO L87 Difference]: Start difference. First operand 167 states and 226 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:11,005 INFO L93 Difference]: Finished difference Result 290 states and 385 transitions. [2024-10-14 12:28:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:28:11,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-10-14 12:28:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:11,008 INFO L225 Difference]: With dead ends: 290 [2024-10-14 12:28:11,008 INFO L226 Difference]: Without dead ends: 288 [2024-10-14 12:28:11,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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-14 12:28:11,010 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:11,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 278 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:28:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-14 12:28:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2024-10-14 12:28:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 190 states have (on average 1.1) internal successors, (209), 197 states have internal predecessors, (209), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 12:28:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 377 transitions. [2024-10-14 12:28:11,066 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 377 transitions. Word has length 81 [2024-10-14 12:28:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:11,067 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 377 transitions. [2024-10-14 12:28:11,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 377 transitions. [2024-10-14 12:28:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 12:28:11,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:11,069 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:11,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 12:28:11,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:11,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:11,070 INFO L85 PathProgramCache]: Analyzing trace with hash 843130934, now seen corresponding path program 1 times [2024-10-14 12:28:11,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:11,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817275690] [2024-10-14 12:28:11,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:11,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:11,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817275690] [2024-10-14 12:28:11,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817275690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:11,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:11,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 12:28:11,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077081127] [2024-10-14 12:28:11,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:11,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 12:28:11,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:11,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 12:28:11,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 12:28:11,897 INFO L87 Difference]: Start difference. First operand 285 states and 377 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:12,592 INFO L93 Difference]: Finished difference Result 562 states and 744 transitions. [2024-10-14 12:28:12,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 12:28:12,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-10-14 12:28:12,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:12,596 INFO L225 Difference]: With dead ends: 562 [2024-10-14 12:28:12,598 INFO L226 Difference]: Without dead ends: 344 [2024-10-14 12:28:12,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-14 12:28:12,600 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 86 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:12,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 432 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:28:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-14 12:28:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 293. [2024-10-14 12:28:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 198 states have (on average 1.101010101010101) internal successors, (218), 205 states have internal predecessors, (218), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 12:28:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 386 transitions. [2024-10-14 12:28:12,655 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 386 transitions. Word has length 81 [2024-10-14 12:28:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:12,655 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 386 transitions. [2024-10-14 12:28:12,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 386 transitions. [2024-10-14 12:28:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 12:28:12,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:12,657 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:12,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 12:28:12,657 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:12,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:12,658 INFO L85 PathProgramCache]: Analyzing trace with hash 464813267, now seen corresponding path program 1 times [2024-10-14 12:28:12,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:12,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891889988] [2024-10-14 12:28:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:12,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:28:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:28:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:28:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:28:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:28:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:28:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:28:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:28:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:28:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:28:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:28:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:28:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:28:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891889988] [2024-10-14 12:28:12,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891889988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:12,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:12,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:28:12,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704954794] [2024-10-14 12:28:12,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:12,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:28:12,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:28:12,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:28:12,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:28:12,715 INFO L87 Difference]: Start difference. First operand 293 states and 386 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:12,805 INFO L93 Difference]: Finished difference Result 616 states and 815 transitions. [2024-10-14 12:28:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:28:12,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-10-14 12:28:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:12,809 INFO L225 Difference]: With dead ends: 616 [2024-10-14 12:28:12,810 INFO L226 Difference]: Without dead ends: 390 [2024-10-14 12:28:12,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:28:12,811 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 47 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:12,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 97 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:28:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-14 12:28:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 322. [2024-10-14 12:28:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 213 states have (on average 1.0892018779342723) internal successors, (232), 222 states have internal predecessors, (232), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-14 12:28:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 424 transitions. [2024-10-14 12:28:12,879 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 424 transitions. Word has length 83 [2024-10-14 12:28:12,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:12,880 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 424 transitions. [2024-10-14 12:28:12,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 424 transitions. [2024-10-14 12:28:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 12:28:12,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:12,881 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:12,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 12:28:12,882 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:12,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1638749302, now seen corresponding path program 1 times [2024-10-14 12:28:12,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:28:12,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105112205] [2024-10-14 12:28:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:12,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:28:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:28:12,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 12:28:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:28:12,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 12:28:12,988 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 12:28:12,989 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:28:12,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 12:28:12,997 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:13,074 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:28:13,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:28:13 BoogieIcfgContainer [2024-10-14 12:28:13,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:28:13,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:28:13,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:28:13,081 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:28:13,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:04" (3/4) ... [2024-10-14 12:28:13,084 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 12:28:13,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:28:13,086 INFO L158 Benchmark]: Toolchain (without parser) took 9561.96ms. Allocated memory was 148.9MB in the beginning and 281.0MB in the end (delta: 132.1MB). Free memory was 101.7MB in the beginning and 236.0MB in the end (delta: -134.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:28:13,086 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:28:13,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.66ms. Allocated memory is still 148.9MB. Free memory was 101.7MB in the beginning and 89.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 12:28:13,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.81ms. Allocated memory is still 148.9MB. Free memory was 89.1MB in the beginning and 87.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:28:13,087 INFO L158 Benchmark]: Boogie Preprocessor took 53.78ms. Allocated memory is still 148.9MB. Free memory was 87.6MB in the beginning and 85.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:28:13,087 INFO L158 Benchmark]: RCFGBuilder took 586.13ms. Allocated memory is still 148.9MB. Free memory was 85.6MB in the beginning and 109.1MB in the end (delta: -23.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 12:28:13,088 INFO L158 Benchmark]: TraceAbstraction took 8577.79ms. Allocated memory was 148.9MB in the beginning and 281.0MB in the end (delta: 132.1MB). Free memory was 109.1MB in the beginning and 236.0MB in the end (delta: -127.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-14 12:28:13,088 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 281.0MB. Free memory is still 236.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:28:13,090 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.16ms. Allocated memory is still 100.7MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.66ms. Allocated memory is still 148.9MB. Free memory was 101.7MB in the beginning and 89.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.81ms. Allocated memory is still 148.9MB. Free memory was 89.1MB in the beginning and 87.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.78ms. Allocated memory is still 148.9MB. Free memory was 87.6MB in the beginning and 85.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 586.13ms. Allocated memory is still 148.9MB. Free memory was 85.6MB in the beginning and 109.1MB in the end (delta: -23.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8577.79ms. Allocated memory was 148.9MB in the beginning and 281.0MB in the end (delta: 132.1MB). Free memory was 109.1MB in the beginning and 236.0MB in the end (delta: -127.0MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 281.0MB. Free memory is still 236.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 0; [L26] signed char var_1_5 = 4; [L27] signed char var_1_6 = -5; [L28] signed char var_1_7 = 2; [L29] signed char var_1_8 = -32; [L68] isInitial = 1 [L69] FCALL initially() [L70] COND TRUE 1 [L71] FCALL updateLastVariables() [L72] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_uchar() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L45] var_1_3 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L51] var_1_5 = __VERIFIER_nondet_char() [L52] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L52] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=-5, var_1_7=2, var_1_8=-32] [L54] var_1_6 = __VERIFIER_nondet_char() [L55] CALL assume_abort_if_not(var_1_6 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L55] RET assume_abort_if_not(var_1_6 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=2, var_1_8=-32] [L57] var_1_7 = __VERIFIER_nondet_char() [L58] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L58] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L59] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L59] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L72] RET updateVariables() [L73] CALL step() [L33] COND TRUE (var_1_2 || var_1_3) && var_1_4 [L34] var_1_1 = (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L36] signed char stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=38, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L37] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, stepLocal_0=38, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L37] COND FALSE !(stepLocal_0 > ((-100 + var_1_1) ^ var_1_1)) [L73] RET step() [L74] CALL, EXPR property() [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L64] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L64-L65] return (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) ; [L74] RET, EXPR property() [L74] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] [L19] reach_error() VAL [isInitial=1, var_1_1=101, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=38, var_1_6=63, var_1_7=101, var_1_8=-32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 526 mSDsluCounter, 2318 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1555 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1237 IncrementalHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 763 mSDtfsCounter, 1237 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=11, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 200 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 959 NumberOfCodeBlocks, 959 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 863 ConstructedInterpolants, 0 QuantifiedInterpolants, 3557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2904/2904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 12:28:13,129 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_amount10_file-60.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 e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:28:15,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:28:15,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 12:28:15,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:28:15,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:28:15,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:28:15,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:28:15,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:28:15,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:28:15,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:28:15,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:28:15,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:28:15,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:28:15,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:28:15,680 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:28:15,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:28:15,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:28:15,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:28:15,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:28:15,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:28:15,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:28:15,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:28:15,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:28:15,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 12:28:15,687 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 12:28:15,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:28:15,688 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 12:28:15,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:28:15,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:28:15,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:28:15,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:28:15,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:28:15,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:28:15,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:28:15,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:28:15,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:28:15,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:28:15,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:28:15,691 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 12:28:15,691 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 12:28:15,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:28:15,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:28:15,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:28:15,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:28:15,696 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 12:28:15,696 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 -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2024-10-14 12:28:16,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:28:16,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:28:16,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:28:16,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:28:16,119 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:28:16,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-14 12:28:17,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:28:18,014 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:28:18,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-10-14 12:28:18,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b36b54d38/c679115827264e50a631d3fecdc6f327/FLAG772ab2de0 [2024-10-14 12:28:18,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b36b54d38/c679115827264e50a631d3fecdc6f327 [2024-10-14 12:28:18,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:28:18,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:28:18,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:28:18,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:28:18,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:28:18,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a339d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18, skipping insertion in model container [2024-10-14 12:28:18,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:28:18,262 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_amount10_file-60.i[915,928] [2024-10-14 12:28:18,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:28:18,338 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:28:18,353 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_amount10_file-60.i[915,928] [2024-10-14 12:28:18,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:28:18,411 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:28:18,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18 WrapperNode [2024-10-14 12:28:18,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:28:18,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:28:18,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:28:18,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:28:18,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,469 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2024-10-14 12:28:18,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:28:18,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:28:18,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:28:18,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:28:18,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,508 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 12:28:18,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:28:18,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:28:18,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:28:18,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:28:18,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (1/1) ... [2024-10-14 12:28:18,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:28:18,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:28:18,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:28:18,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:28:18,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:28:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 12:28:18,636 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:28:18,636 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:28:18,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:28:18,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:28:18,721 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:28:18,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:28:18,980 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 12:28:18,980 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:28:19,059 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:28:19,059 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:28:19,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:19 BoogieIcfgContainer [2024-10-14 12:28:19,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:28:19,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:28:19,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:28:19,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:28:19,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:28:18" (1/3) ... [2024-10-14 12:28:19,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255a14b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:28:19, skipping insertion in model container [2024-10-14 12:28:19,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:28:18" (2/3) ... [2024-10-14 12:28:19,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255a14b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:28:19, skipping insertion in model container [2024-10-14 12:28:19,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:19" (3/3) ... [2024-10-14 12:28:19,076 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2024-10-14 12:28:19,094 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:28:19,095 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:28:19,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:28:19,193 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;@742b08ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:28:19,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:28:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 12:28:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 12:28:19,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:19,231 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:19,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:19,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash -238086645, now seen corresponding path program 1 times [2024-10-14 12:28:19,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:28:19,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468644708] [2024-10-14 12:28:19,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:19,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:28:19,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:28:19,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 12:28:19,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 12:28:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:19,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 12:28:19,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:28:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-14 12:28:19,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:28:19,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:28:19,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468644708] [2024-10-14 12:28:19,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468644708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:19,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:19,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:28:19,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267618687] [2024-10-14 12:28:19,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:19,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:28:19,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:28:19,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:28:19,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:28:19,479 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:19,512 INFO L93 Difference]: Finished difference Result 65 states and 110 transitions. [2024-10-14 12:28:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:28:19,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-14 12:28:19,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:19,524 INFO L225 Difference]: With dead ends: 65 [2024-10-14 12:28:19,524 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 12:28:19,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:28:19,533 INFO L432 NwaCegarLoop]: 42 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, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:19,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:28:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 12:28:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 12:28:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 12:28:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-14 12:28:19,571 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 74 [2024-10-14 12:28:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:19,572 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-14 12:28:19,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-14 12:28:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 12:28:19,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:19,575 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:19,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 12:28:19,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:28:19,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:19,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2086146549, now seen corresponding path program 1 times [2024-10-14 12:28:19,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:28:19,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723569872] [2024-10-14 12:28:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:19,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:28:19,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:28:19,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 12:28:19,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 12:28:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:19,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 12:28:19,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:28:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:23,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:28:23,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:28:23,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723569872] [2024-10-14 12:28:23,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723569872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:23,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:23,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:28:23,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611464487] [2024-10-14 12:28:23,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:23,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:28:23,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:28:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:28:23,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:28:23,054 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:23,302 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2024-10-14 12:28:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:28:23,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-14 12:28:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:23,305 INFO L225 Difference]: With dead ends: 72 [2024-10-14 12:28:23,305 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 12:28:23,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:28:23,309 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 54 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:23,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 148 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 12:28:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 12:28:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2024-10-14 12:28:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 12:28:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2024-10-14 12:28:23,334 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 74 [2024-10-14 12:28:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:23,334 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2024-10-14 12:28:23,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2024-10-14 12:28:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 12:28:23,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:23,337 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:23,344 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-14 12:28:23,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:28:23,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:23,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2086086967, now seen corresponding path program 1 times [2024-10-14 12:28:23,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:28:23,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735499795] [2024-10-14 12:28:23,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:23,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:28:23,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:28:23,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 12:28:23,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 12:28:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:23,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 12:28:23,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:28:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-14 12:28:26,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:28:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:27,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:28:27,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735499795] [2024-10-14 12:28:27,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735499795] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 12:28:27,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 12:28:27,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-10-14 12:28:27,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808659560] [2024-10-14 12:28:27,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:27,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:28:27,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:28:27,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:28:27,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-14 12:28:27,778 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:28,553 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2024-10-14 12:28:28,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:28:28,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-14 12:28:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:28,557 INFO L225 Difference]: With dead ends: 83 [2024-10-14 12:28:28,558 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 12:28:28,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-14 12:28:28,559 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 53 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:28,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:28:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 12:28:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2024-10-14 12:28:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 12:28:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2024-10-14 12:28:28,577 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 74 [2024-10-14 12:28:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:28,578 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2024-10-14 12:28:28,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2024-10-14 12:28:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 12:28:28,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:28,582 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:28,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 12:28:28,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:28:28,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:28,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2028888247, now seen corresponding path program 1 times [2024-10-14 12:28:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:28:28,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085683595] [2024-10-14 12:28:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:28,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:28:28,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:28:28,786 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-14 12:28:28,787 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-14 12:28:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:28,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 12:28:28,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:28:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:29,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:28:29,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:28:29,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085683595] [2024-10-14 12:28:29,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085683595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:28:29,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:28:29,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:28:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575447114] [2024-10-14 12:28:29,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:29,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:28:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:28:29,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:28:29,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:28:29,762 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:29,848 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2024-10-14 12:28:29,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:28:29,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-14 12:28:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:29,850 INFO L225 Difference]: With dead ends: 57 [2024-10-14 12:28:29,850 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 12:28:29,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:28:29,852 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:29,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:28:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 12:28:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-14 12:28:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 12:28:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-14 12:28:29,874 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 74 [2024-10-14 12:28:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:29,875 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-14 12:28:29,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-14 12:28:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 12:28:29,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:28:29,880 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:28:29,886 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 (5)] Forceful destruction successful, exit code 0 [2024-10-14 12:28:30,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:28:30,084 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:28:30,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:28:30,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2028828665, now seen corresponding path program 1 times [2024-10-14 12:28:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:28:30,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797889562] [2024-10-14 12:28:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:30,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:28:30,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:28:30,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 12:28:30,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 12:28:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:30,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 12:28:30,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:28:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-14 12:28:30,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:28:30,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:28:30,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797889562] [2024-10-14 12:28:30,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797889562] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 12:28:30,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [442592339] [2024-10-14 12:28:30,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:28:30,513 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 12:28:30,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 12:28:30,516 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 12:28:30,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-14 12:28:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:28:30,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-14 12:28:30,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:28:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-14 12:28:31,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:28:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 12:28:33,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [442592339] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 12:28:33,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 12:28:33,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 8] total 15 [2024-10-14 12:28:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42199534] [2024-10-14 12:28:33,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:28:33,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:28:33,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:28:33,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:28:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-14 12:28:33,299 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:28:34,069 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2024-10-14 12:28:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:28:34,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-14 12:28:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:28:34,071 INFO L225 Difference]: With dead ends: 58 [2024-10-14 12:28:34,071 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 12:28:34,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-10-14 12:28:34,072 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:28:34,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 12:28:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 12:28:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 12:28:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 12:28:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 12:28:34,074 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2024-10-14 12:28:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:28:34,074 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 12:28:34,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 12:28:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 12:28:34,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 12:28:34,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:28:34,082 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 (6)] Forceful destruction successful, exit code 0 [2024-10-14 12:28:34,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-14 12:28:34,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 12:28:34,482 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 12:28:34,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 12:28:35,422 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:28:35,432 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-14 12:28:35,435 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-14 12:28:35,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:28:35 BoogieIcfgContainer [2024-10-14 12:28:35,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:28:35,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:28:35,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:28:35,445 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:28:35,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:28:19" (3/4) ... [2024-10-14 12:28:35,448 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 12:28:35,451 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 12:28:35,457 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-14 12:28:35,458 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-14 12:28:35,458 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 12:28:35,458 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 12:28:35,568 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 12:28:35,569 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 12:28:35,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:28:35,570 INFO L158 Benchmark]: Toolchain (without parser) took 17528.35ms. Allocated memory was 81.8MB in the beginning and 343.9MB in the end (delta: 262.1MB). Free memory was 48.6MB in the beginning and 270.8MB in the end (delta: -222.2MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-10-14 12:28:35,570 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 56.6MB. Free memory was 35.3MB in the beginning and 35.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:28:35,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.25ms. Allocated memory is still 81.8MB. Free memory was 48.3MB in the beginning and 59.6MB in the end (delta: -11.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 12:28:35,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.30ms. Allocated memory is still 81.8MB. Free memory was 59.4MB in the beginning and 57.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:28:35,571 INFO L158 Benchmark]: Boogie Preprocessor took 70.44ms. Allocated memory is still 81.8MB. Free memory was 57.7MB in the beginning and 55.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:28:35,571 INFO L158 Benchmark]: RCFGBuilder took 516.13ms. Allocated memory is still 81.8MB. Free memory was 55.5MB in the beginning and 38.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 12:28:35,571 INFO L158 Benchmark]: TraceAbstraction took 16378.88ms. Allocated memory was 81.8MB in the beginning and 343.9MB in the end (delta: 262.1MB). Free memory was 37.7MB in the beginning and 276.1MB in the end (delta: -238.3MB). Peak memory consumption was 183.9MB. Max. memory is 16.1GB. [2024-10-14 12:28:35,571 INFO L158 Benchmark]: Witness Printer took 124.59ms. Allocated memory is still 343.9MB. Free memory was 276.1MB in the beginning and 270.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 12:28:35,573 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.21ms. Allocated memory is still 56.6MB. Free memory was 35.3MB in the beginning and 35.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.25ms. Allocated memory is still 81.8MB. Free memory was 48.3MB in the beginning and 59.6MB in the end (delta: -11.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.30ms. Allocated memory is still 81.8MB. Free memory was 59.4MB in the beginning and 57.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.44ms. Allocated memory is still 81.8MB. Free memory was 57.7MB in the beginning and 55.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 516.13ms. Allocated memory is still 81.8MB. Free memory was 55.5MB in the beginning and 38.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16378.88ms. Allocated memory was 81.8MB in the beginning and 343.9MB in the end (delta: 262.1MB). Free memory was 37.7MB in the beginning and 276.1MB in the end (delta: -238.3MB). Peak memory consumption was 183.9MB. Max. memory is 16.1GB. * Witness Printer took 124.59ms. Allocated memory is still 343.9MB. Free memory was 276.1MB in the beginning and 270.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 5, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 577 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 337 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 240 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 625 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=2, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 52 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 584 ConstructedInterpolants, 6 QuantifiedInterpolants, 3084 SizeOfPredicates, 59 NumberOfNonLiveVariables, 723 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 2040/2112 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-10-14 12:28:35,609 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 Writing output log to file Ultimate.log Result: TRUE