./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.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 838365b849078ce23c8f5047cd4aafa49e92ec0b6863e12a604d1c5b7130a939 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:49:56,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:49:56,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:49:56,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:49:56,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:49:56,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:49:56,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:49:56,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:49:56,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:49:56,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:49:56,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:49:56,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:49:56,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:49:56,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:49:56,971 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:49:56,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:49:56,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:49:56,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:49:56,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:49:56,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:49:56,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:49:56,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:49:56,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:49:56,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:49:56,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:49:56,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:49:56,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:49:56,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:49:56,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:49:56,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:49:56,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:49:56,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:49:56,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:49:56,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:49:56,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:49:56,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:49:56,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:49:56,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:49:56,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:49:56,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:49:56,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:49:56,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:49:56,981 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 -> 838365b849078ce23c8f5047cd4aafa49e92ec0b6863e12a604d1c5b7130a939 [2024-11-12 06:49:57,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:49:57,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:49:57,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:49:57,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:49:57,301 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:49:57,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.i [2024-11-12 06:49:58,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:49:59,001 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:49:59,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.i [2024-11-12 06:49:59,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed5b6527/12c09514eb0b4edbb4ddef4fd3b198c2/FLAG2e0050346 [2024-11-12 06:49:59,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed5b6527/12c09514eb0b4edbb4ddef4fd3b198c2 [2024-11-12 06:49:59,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:49:59,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:49:59,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:49:59,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:49:59,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:49:59,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0cd885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59, skipping insertion in model container [2024-11-12 06:49:59,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:49:59,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.i[915,928] [2024-11-12 06:49:59,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:49:59,651 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:49:59,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-59.i[915,928] [2024-11-12 06:49:59,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:49:59,710 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:49:59,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59 WrapperNode [2024-11-12 06:49:59,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:49:59,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:49:59,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:49:59,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:49:59,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,770 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2024-11-12 06:49:59,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:49:59,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:49:59,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:49:59,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:49:59,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,815 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:49:59,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:49:59,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:49:59,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:49:59,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:49:59,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (1/1) ... [2024-11-12 06:49:59,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:49:59,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:49:59,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:49:59,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:49:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:49:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:49:59,944 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:49:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:49:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:49:59,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:50:00,033 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:50:00,036 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:50:00,498 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 06:50:00,499 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:50:00,515 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:50:00,515 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:50:00,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:50:00 BoogieIcfgContainer [2024-11-12 06:50:00,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:50:00,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:50:00,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:50:00,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:50:00,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:49:59" (1/3) ... [2024-11-12 06:50:00,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43813733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:50:00, skipping insertion in model container [2024-11-12 06:50:00,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:59" (2/3) ... [2024-11-12 06:50:00,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43813733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:50:00, skipping insertion in model container [2024-11-12 06:50:00,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:50:00" (3/3) ... [2024-11-12 06:50:00,527 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-59.i [2024-11-12 06:50:00,546 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:50:00,547 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:50:00,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:50:00,637 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;@4d5a11e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:50:00,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:50:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:50:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 06:50:00,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:00,660 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:50:00,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:00,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:00,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1164860862, now seen corresponding path program 1 times [2024-11-12 06:50:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396589153] [2024-11-12 06:50:00,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:00,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:00,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:00,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:00,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 06:50:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 06:50:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:50:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 06:50:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:50:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:50:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:50:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:50:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:50:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:50:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 06:50:01,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:01,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396589153] [2024-11-12 06:50:01,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396589153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:01,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:01,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:50:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92761029] [2024-11-12 06:50:01,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:01,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:50:01,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:01,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:50:01,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:50:01,136 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:50:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:01,158 INFO L93 Difference]: Finished difference Result 101 states and 168 transitions. [2024-11-12 06:50:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:50:01,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2024-11-12 06:50:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:01,168 INFO L225 Difference]: With dead ends: 101 [2024-11-12 06:50:01,168 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 06:50:01,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:50:01,177 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:01,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:50:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 06:50:01,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 06:50:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:50:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-12 06:50:01,222 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 95 [2024-11-12 06:50:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:01,223 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-12 06:50:01,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:50:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-12 06:50:01,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 06:50:01,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:01,230 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:50:01,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:50:01,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:01,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:01,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1236847222, now seen corresponding path program 1 times [2024-11-12 06:50:01,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:01,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022629976] [2024-11-12 06:50:01,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 06:50:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 06:50:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:50:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 06:50:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:50:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:50:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:50:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:50:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:50:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:50:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 06:50:01,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:01,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022629976] [2024-11-12 06:50:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022629976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:01,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:01,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:50:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463446349] [2024-11-12 06:50:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:01,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:50:01,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:01,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:50:01,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:50:01,796 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 06:50:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:01,932 INFO L93 Difference]: Finished difference Result 145 states and 214 transitions. [2024-11-12 06:50:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:50:01,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-12 06:50:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:01,936 INFO L225 Difference]: With dead ends: 145 [2024-11-12 06:50:01,937 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 06:50:01,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:50:01,940 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 51 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:01,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 203 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:50:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 06:50:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2024-11-12 06:50:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 06:50:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-11-12 06:50:01,984 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 95 [2024-11-12 06:50:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:01,984 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-11-12 06:50:01,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 06:50:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-11-12 06:50:01,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 06:50:01,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:01,988 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:50:01,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:50:01,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:01,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1287173988, now seen corresponding path program 1 times [2024-11-12 06:50:01,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:01,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73871488] [2024-11-12 06:50:01,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:01,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 06:50:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 06:50:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:50:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 06:50:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:50:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:50:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:50:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:50:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:50:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:50:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 06:50:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73871488] [2024-11-12 06:50:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73871488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:02,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:02,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:50:02,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786954611] [2024-11-12 06:50:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:02,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:50:02,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:02,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:50:02,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:50:02,368 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 06:50:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:02,507 INFO L93 Difference]: Finished difference Result 183 states and 267 transitions. [2024-11-12 06:50:02,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:50:02,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2024-11-12 06:50:02,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:02,510 INFO L225 Difference]: With dead ends: 183 [2024-11-12 06:50:02,511 INFO L226 Difference]: Without dead ends: 136 [2024-11-12 06:50:02,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:50:02,513 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:02,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 201 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:50:02,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-12 06:50:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2024-11-12 06:50:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 06:50:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-11-12 06:50:02,544 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 96 [2024-11-12 06:50:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:02,545 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-11-12 06:50:02,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 06:50:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-11-12 06:50:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 06:50:02,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:02,551 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:50:02,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:50:02,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:02,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash 866463787, now seen corresponding path program 1 times [2024-11-12 06:50:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:02,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728639168] [2024-11-12 06:50:02,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:02,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 06:50:02,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813833932] [2024-11-12 06:50:02,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:02,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:50:02,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:50:02,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:50:02,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 06:50:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:02,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-12 06:50:02,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:50:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 202 proven. 90 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-12 06:50:05,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:50:13,376 WARN L286 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 06:50:26,907 WARN L286 SmtUtils]: Spent 10.65s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 06:50:50,378 WARN L286 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)