./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-95.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 1b12db86960fa9dc6b9cfa8223c629c146a6be8798d3651a94f684c115400abd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:41:29,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:41:29,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:41:29,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:41:29,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:41:29,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:41:29,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:41:29,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:41:29,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:41:29,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:41:29,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:41:29,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:41:29,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:41:29,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:41:29,934 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:41:29,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:41:29,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:41:29,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:41:29,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:41:29,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:41:29,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:41:29,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:41:29,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:41:29,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:41:29,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:41:29,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:41:29,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:41:29,946 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:41:29,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:41:29,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:41:29,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:41:29,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:41:29,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:41:29,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:41:29,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:41:29,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:41:29,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:41:29,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:41:29,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:41:29,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:41:29,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:41:29,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:41:29,952 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 -> 1b12db86960fa9dc6b9cfa8223c629c146a6be8798d3651a94f684c115400abd [2024-10-13 00:41:30,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:41:30,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:41:30,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:41:30,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:41:30,292 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:41:30,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-95.i [2024-10-13 00:41:31,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:41:32,147 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:41:32,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-95.i [2024-10-13 00:41:32,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285b85df2/03d867b3e495495aa80b021c254611ac/FLAG28db0c223 [2024-10-13 00:41:32,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285b85df2/03d867b3e495495aa80b021c254611ac [2024-10-13 00:41:32,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:41:32,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:41:32,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:41:32,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:41:32,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:41:32,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53809aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32, skipping insertion in model container [2024-10-13 00:41:32,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:41:32,416 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-95.i[916,929] [2024-10-13 00:41:32,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:41:32,509 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:41:32,520 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-95.i[916,929] [2024-10-13 00:41:32,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:41:32,624 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:41:32,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32 WrapperNode [2024-10-13 00:41:32,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:41:32,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:41:32,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:41:32,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:41:32,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,715 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 371 [2024-10-13 00:41:32,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:41:32,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:41:32,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:41:32,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:41:32,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,776 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:41:32,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:41:32,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:41:32,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:41:32,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:41:32,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (1/1) ... [2024-10-13 00:41:32,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:41:32,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:41:32,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:41:32,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:41:32,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:41:32,930 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:41:32,931 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:41:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:41:32,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:41:32,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:41:33,063 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:41:33,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:41:33,765 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 00:41:33,765 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:41:33,805 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:41:33,806 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:41:33,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:41:33 BoogieIcfgContainer [2024-10-13 00:41:33,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:41:33,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:41:33,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:41:33,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:41:33,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:41:32" (1/3) ... [2024-10-13 00:41:33,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de2232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:41:33, skipping insertion in model container [2024-10-13 00:41:33,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:41:32" (2/3) ... [2024-10-13 00:41:33,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de2232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:41:33, skipping insertion in model container [2024-10-13 00:41:33,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:41:33" (3/3) ... [2024-10-13 00:41:33,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-95.i [2024-10-13 00:41:33,835 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:41:33,836 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:41:33,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:41:33,919 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;@90df0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:41:33,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:41:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 100 states have (on average 1.55) internal successors, (155), 101 states have internal predecessors, (155), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 00:41:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-10-13 00:41:33,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:41:33,946 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:41:33,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:41:33,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:41:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1783376423, now seen corresponding path program 1 times [2024-10-13 00:41:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:41:33,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9522926] [2024-10-13 00:41:33,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:41:33,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:41:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:41:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:41:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:41:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 00:41:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 00:41:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 00:41:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 00:41:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:41:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:41:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:41:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:41:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:41:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:41:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:41:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:41:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:41:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:41:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:41:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:41:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:41:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:41:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:41:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:41:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:41:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 00:41:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:41:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:41:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:41:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:41:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 00:41:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:41:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 00:41:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 00:41:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:41:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:41:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:41:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:41:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:41:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:41:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 00:41:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 00:41:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-13 00:41:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 00:41:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-13 00:41:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 00:41:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-13 00:41:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-13 00:41:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-13 00:41:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-13 00:41:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-10-13 00:41:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-10-13 00:41:34,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:41:34,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9522926] [2024-10-13 00:41:34,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9522926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:41:34,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:41:34,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:41:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927802324] [2024-10-13 00:41:34,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:41:34,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:41:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:41:34,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:41:34,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:41:34,982 INFO L87 Difference]: Start difference. First operand has 153 states, 100 states have (on average 1.55) internal successors, (155), 101 states have internal predecessors, (155), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-10-13 00:41:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:41:35,099 INFO L93 Difference]: Finished difference Result 396 states and 730 transitions. [2024-10-13 00:41:35,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:41:35,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2024-10-13 00:41:35,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:41:35,120 INFO L225 Difference]: With dead ends: 396 [2024-10-13 00:41:35,121 INFO L226 Difference]: Without dead ends: 244 [2024-10-13 00:41:35,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:41:35,132 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 150 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:41:35,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 479 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:41:35,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-13 00:41:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2024-10-13 00:41:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 173 states have (on average 1.5491329479768785) internal successors, (268), 174 states have internal predecessors, (268), 65 states have call successors, (65), 2 states have call predecessors, (65), 2 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 00:41:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 398 transitions. [2024-10-13 00:41:35,216 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 398 transitions. Word has length 307 [2024-10-13 00:41:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:41:35,217 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 398 transitions. [2024-10-13 00:41:35,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-10-13 00:41:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 398 transitions. [2024-10-13 00:41:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-10-13 00:41:35,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:41:35,225 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:41:35,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:41:35,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:41:35,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:41:35,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1642827813, now seen corresponding path program 1 times [2024-10-13 00:41:35,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:41:35,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971674662] [2024-10-13 00:41:35,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:41:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:41:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:41:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:41:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:41:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 00:41:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 00:41:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 00:41:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 00:41:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:41:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:41:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:41:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:41:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:41:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:41:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:41:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:41:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:41:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:41:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:41:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:41:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:41:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:41:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:41:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:41:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:41:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 00:41:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:41:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:41:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:41:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 00:41:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 00:41:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 00:41:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 00:41:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 00:41:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 00:41:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 00:41:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 00:41:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-13 00:41:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 00:41:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-13 00:41:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 00:41:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-13 00:41:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-13 00:41:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-13 00:41:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-13 00:41:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 00:41:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-13 00:41:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-13 00:41:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-13 00:41:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-13 00:41:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-10-13 00:41:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:41:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-10-13 00:41:37,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:41:37,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971674662] [2024-10-13 00:41:37,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971674662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:41:37,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:41:37,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 00:41:37,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165086458] [2024-10-13 00:41:37,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:41:37,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 00:41:37,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:41:37,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 00:41:37,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:41:37,351 INFO L87 Difference]: Start difference. First operand 241 states and 398 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-13 00:41:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:41:39,145 INFO L93 Difference]: Finished difference Result 894 states and 1462 transitions. [2024-10-13 00:41:39,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 00:41:39,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 307 [2024-10-13 00:41:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:41:39,159 INFO L225 Difference]: With dead ends: 894 [2024-10-13 00:41:39,160 INFO L226 Difference]: Without dead ends: 654 [2024-10-13 00:41:39,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:41:39,165 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 825 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:41:39,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 872 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 00:41:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-10-13 00:41:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 644. [2024-10-13 00:41:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 447 states have (on average 1.505592841163311) internal successors, (673), 449 states have internal predecessors, (673), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 186 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-13 00:41:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1049 transitions. [2024-10-13 00:41:39,314 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1049 transitions. Word has length 307 [2024-10-13 00:41:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:41:39,317 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 1049 transitions. [2024-10-13 00:41:39,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-13 00:41:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1049 transitions. [2024-10-13 00:41:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-10-13 00:41:39,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:41:39,325 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:41:39,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:41:39,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:41:39,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:41:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash -825179363, now seen corresponding path program 1 times [2024-10-13 00:41:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:41:39,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108412587] [2024-10-13 00:41:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:41:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:41:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat