./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_codestructure_dependencies_file-98.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 9d90cb0c9a93747735cec7761cf320934dd48aba716104c569c7b4cda39c60e0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:15:51,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:15:51,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:15:51,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:15:51,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:15:51,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:15:51,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:15:51,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:15:51,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:15:51,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:15:51,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:15:51,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:15:51,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:15:51,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:15:51,835 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:15:51,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:15:51,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:15:51,836 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:15:51,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:15:51,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:15:51,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:15:51,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:15:51,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:15:51,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:15:51,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:15:51,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:15:51,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:15:51,844 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:15:51,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:15:51,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:15:51,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:15:51,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:15:51,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:15:51,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:15:51,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:15:51,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:15:51,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:15:51,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:15:51,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:15:51,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:15:51,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:15:51,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:15:51,850 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 -> 9d90cb0c9a93747735cec7761cf320934dd48aba716104c569c7b4cda39c60e0 [2024-11-10 03:15:52,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:15:52,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:15:52,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:15:52,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:15:52,113 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:15:52,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-98.i [2024-11-10 03:15:53,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:15:53,798 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:15:53,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-98.i [2024-11-10 03:15:53,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85cbf495c/4a0604da2eed4da89626f3ff639a9b56/FLAGae12af6aa [2024-11-10 03:15:54,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85cbf495c/4a0604da2eed4da89626f3ff639a9b56 [2024-11-10 03:15:54,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:15:54,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:15:54,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:15:54,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:15:54,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:15:54,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5951c52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54, skipping insertion in model container [2024-11-10 03:15:54,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:15:54,388 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_codestructure_dependencies_file-98.i[919,932] [2024-11-10 03:15:54,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:15:54,457 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:15:54,466 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_codestructure_dependencies_file-98.i[919,932] [2024-11-10 03:15:54,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:15:54,503 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:15:54,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54 WrapperNode [2024-11-10 03:15:54,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:15:54,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:15:54,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:15:54,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:15:54,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,565 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2024-11-10 03:15:54,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:15:54,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:15:54,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:15:54,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:15:54,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,610 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-10 03:15:54,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:15:54,635 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:15:54,635 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:15:54,635 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:15:54,636 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (1/1) ... [2024-11-10 03:15:54,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:15:54,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:15:54,669 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-10 03:15:54,672 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-10 03:15:54,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:15:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:15:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:15:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:15:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:15:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:15:54,779 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:15:54,781 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:15:55,059 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~bitwise17#1; [2024-11-10 03:15:55,079 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:15:55,079 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:15:55,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:15:55,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:15:55,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:55 BoogieIcfgContainer [2024-11-10 03:15:55,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:15:55,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:15:55,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:15:55,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:15:55,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:15:54" (1/3) ... [2024-11-10 03:15:55,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8ca6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:15:55, skipping insertion in model container [2024-11-10 03:15:55,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:54" (2/3) ... [2024-11-10 03:15:55,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8ca6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:15:55, skipping insertion in model container [2024-11-10 03:15:55,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:55" (3/3) ... [2024-11-10 03:15:55,103 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-98.i [2024-11-10 03:15:55,117 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:15:55,117 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:15:55,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:15:55,198 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;@16101a9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:15:55,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:15:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 03:15:55,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 03:15:55,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:55,230 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:15:55,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:55,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:55,237 INFO L85 PathProgramCache]: Analyzing trace with hash -888344967, now seen corresponding path program 1 times [2024-11-10 03:15:55,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:55,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426073434] [2024-11-10 03:15:55,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:15:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 03:15:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:15:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 03:15:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 03:15:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:15:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:15:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:15:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:15:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:15:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:15:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:15:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:15:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:15:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:15:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:15:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:15:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:15:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:15:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:15:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:15:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:15:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:15:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:15:55,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:55,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426073434] [2024-11-10 03:15:55,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426073434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:55,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:55,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:15:55,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551807295] [2024-11-10 03:15:55,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:55,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:15:55,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:55,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:15:55,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:15:55,777 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 03:15:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:15:55,818 INFO L93 Difference]: Finished difference Result 146 states and 249 transitions. [2024-11-10 03:15:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:15:55,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 155 [2024-11-10 03:15:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:15:55,831 INFO L225 Difference]: With dead ends: 146 [2024-11-10 03:15:55,831 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 03:15:55,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-10 03:15:55,839 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:15:55,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:15:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 03:15:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 03:15:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 03:15:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2024-11-10 03:15:55,887 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 155 [2024-11-10 03:15:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:15:55,887 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2024-11-10 03:15:55,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 03:15:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2024-11-10 03:15:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 03:15:55,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:55,893 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:15:55,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:15:55,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:55,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1741216387, now seen corresponding path program 1 times [2024-11-10 03:15:55,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:55,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238462983] [2024-11-10 03:15:55,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:15:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 03:15:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:15:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 03:15:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 03:15:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:15:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:15:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:15:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:15:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:15:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:15:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:15:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:15:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:15:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:15:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:15:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:15:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:15:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:15:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:15:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:15:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:15:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:15:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:15:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238462983] [2024-11-10 03:15:56,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238462983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:56,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:56,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:15:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799845786] [2024-11-10 03:15:56,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:56,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:15:56,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:56,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:15:56,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:15:56,627 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:15:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:15:56,853 INFO L93 Difference]: Finished difference Result 211 states and 320 transitions. [2024-11-10 03:15:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:15:56,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-10 03:15:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:15:56,856 INFO L225 Difference]: With dead ends: 211 [2024-11-10 03:15:56,859 INFO L226 Difference]: Without dead ends: 142 [2024-11-10 03:15:56,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:15:56,861 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 59 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:15:56,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 229 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:15:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-10 03:15:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-10 03:15:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 03:15:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 212 transitions. [2024-11-10 03:15:56,887 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 212 transitions. Word has length 155 [2024-11-10 03:15:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:15:56,887 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 212 transitions. [2024-11-10 03:15:56,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:15:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 212 transitions. [2024-11-10 03:15:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 03:15:56,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:56,890 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:15:56,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:15:56,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:56,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1650698532, now seen corresponding path program 1 times [2024-11-10 03:15:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:56,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577015791] [2024-11-10 03:15:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:15:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 03:15:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:15:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 03:15:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 03:15:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:15:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:15:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:15:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:15:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:15:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:15:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:15:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:15:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:15:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:15:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:15:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:15:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:15:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:15:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:15:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:15:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:15:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:15:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:15:57,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:57,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577015791] [2024-11-10 03:15:57,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577015791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:57,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:15:57,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172593608] [2024-11-10 03:15:57,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:57,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:15:57,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:57,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:15:57,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:15:57,600 INFO L87 Difference]: Start difference. First operand 139 states and 212 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:15:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:15:57,939 INFO L93 Difference]: Finished difference Result 322 states and 490 transitions. [2024-11-10 03:15:57,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:15:57,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-10 03:15:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:15:57,945 INFO L225 Difference]: With dead ends: 322 [2024-11-10 03:15:57,945 INFO L226 Difference]: Without dead ends: 186 [2024-11-10 03:15:57,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-10 03:15:57,949 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 105 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:15:57,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 282 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:15:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-10 03:15:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 138. [2024-11-10 03:15:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 03:15:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 208 transitions. [2024-11-10 03:15:57,980 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 208 transitions. Word has length 155 [2024-11-10 03:15:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:15:57,981 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 208 transitions. [2024-11-10 03:15:57,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:15:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 208 transitions. [2024-11-10 03:15:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 03:15:57,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:57,986 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:15:57,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:15:57,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:57,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:57,987 INFO L85 PathProgramCache]: Analyzing trace with hash 836814301, now seen corresponding path program 1 times [2024-11-10 03:15:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:57,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934373231] [2024-11-10 03:15:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:57,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:15:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 03:15:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:15:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 03:15:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 03:15:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:15:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:15:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:15:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:15:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:15:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:15:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:15:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:15:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:15:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:15:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:15:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:15:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:15:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:15:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:15:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 03:15:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:15:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 03:15:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 03:15:58,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:58,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934373231] [2024-11-10 03:15:58,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934373231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:58,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:58,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 03:15:58,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688445701] [2024-11-10 03:15:58,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:58,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 03:15:58,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:58,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 03:15:58,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:15:58,967 INFO L87 Difference]: Start difference. First operand 138 states and 208 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:16:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:00,223 INFO L93 Difference]: Finished difference Result 696 states and 1041 transitions. [2024-11-10 03:16:00,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:16:00,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-10 03:16:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:00,228 INFO L225 Difference]: With dead ends: 696 [2024-11-10 03:16:00,228 INFO L226 Difference]: Without dead ends: 561 [2024-11-10 03:16:00,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:16:00,229 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 449 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:00,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 338 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 03:16:00,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-10 03:16:00,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 244. [2024-11-10 03:16:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 153 states have internal predecessors, (189), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-10 03:16:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 365 transitions. [2024-11-10 03:16:00,294 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 365 transitions. Word has length 155 [2024-11-10 03:16:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:00,295 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 365 transitions. [2024-11-10 03:16:00,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 03:16:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 365 transitions. [2024-11-10 03:16:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 03:16:00,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:00,297 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:16:00,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:16:00,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:00,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1715342660, now seen corresponding path program 1 times [2024-11-10 03:16:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:16:00,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573635414] [2024-11-10 03:16:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:00,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:16:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat