./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_fillercode_fillercodesize_ps-cn-25_file-28.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 c9ef5ba1706ac871887032b03f34be305eba98b549af8f4e64ec3eb7f553dee0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:18:25,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:18:25,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:18:25,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:18:25,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:18:25,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:18:25,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:18:25,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:18:25,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:18:25,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:18:25,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:18:25,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:18:25,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:18:25,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:18:25,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:18:25,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:18:25,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:18:25,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:18:25,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:18:25,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:18:25,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:18:25,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:18:25,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:18:25,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:18:25,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:18:25,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:18:25,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:18:25,901 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:18:25,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:18:25,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:18:25,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:18:25,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:18:25,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:18:25,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:18:25,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:18:25,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:18:25,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:18:25,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:18:25,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:18:25,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:18:25,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:18:25,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:18:25,907 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 -> c9ef5ba1706ac871887032b03f34be305eba98b549af8f4e64ec3eb7f553dee0 [2024-11-16 13:18:26,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:18:26,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:18:26,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:18:26,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:18:26,231 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:18:26,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-28.i [2024-11-16 13:18:27,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:18:27,985 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:18:27,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-28.i [2024-11-16 13:18:28,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ce4677c/4a8f21ac9a1b424b8ffc057375fd2080/FLAG86d3632b8 [2024-11-16 13:18:28,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96ce4677c/4a8f21ac9a1b424b8ffc057375fd2080 [2024-11-16 13:18:28,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:18:28,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:18:28,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:18:28,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:18:28,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:18:28,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce915cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28, skipping insertion in model container [2024-11-16 13:18:28,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:18:28,246 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_fillercode_fillercodesize_ps-cn-25_file-28.i[915,928] [2024-11-16 13:18:28,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:18:28,359 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:18:28,373 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_fillercode_fillercodesize_ps-cn-25_file-28.i[915,928] [2024-11-16 13:18:28,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:18:28,463 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:18:28,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28 WrapperNode [2024-11-16 13:18:28,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:18:28,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:18:28,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:18:28,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:18:28,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,534 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 254 [2024-11-16 13:18:28,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:18:28,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:18:28,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:18:28,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:18:28,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,580 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-16 13:18:28,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:18:28,633 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:18:28,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:18:28,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:18:28,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (1/1) ... [2024-11-16 13:18:28,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:18:28,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:18:28,671 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-16 13:18:28,684 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-16 13:18:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:18:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:18:28,733 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:18:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:18:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:18:28,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:18:28,856 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:18:28,859 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:18:29,343 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L208: havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2024-11-16 13:18:29,412 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-16 13:18:29,412 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:18:29,452 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:18:29,452 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:18:29,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:18:29 BoogieIcfgContainer [2024-11-16 13:18:29,453 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:18:29,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:18:29,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:18:29,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:18:29,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:18:28" (1/3) ... [2024-11-16 13:18:29,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f93d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:18:29, skipping insertion in model container [2024-11-16 13:18:29,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:28" (2/3) ... [2024-11-16 13:18:29,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f93d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:18:29, skipping insertion in model container [2024-11-16 13:18:29,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:18:29" (3/3) ... [2024-11-16 13:18:29,470 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-28.i [2024-11-16 13:18:29,496 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:18:29,497 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:18:29,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:18:29,591 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;@2e495bf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:18:29,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:18:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 74 states have internal predecessors, (97), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-16 13:18:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-16 13:18:29,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:29,620 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:29,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:29,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash 706568523, now seen corresponding path program 1 times [2024-11-16 13:18:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132583295] [2024-11-16 13:18:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:29,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:18:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:18:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:18:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:18:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:18:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:18:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:18:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:18:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:18:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:18:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:18:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:18:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:18:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-16 13:18:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:18:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:18:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:18:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-16 13:18:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-16 13:18:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-16 13:18:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-16 13:18:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-16 13:18:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-16 13:18:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-16 13:18:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-16 13:18:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-16 13:18:30,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:30,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132583295] [2024-11-16 13:18:30,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132583295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:30,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:30,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:18:30,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811165909] [2024-11-16 13:18:30,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:30,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:18:30,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:30,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:18:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:18:30,456 INFO L87 Difference]: Start difference. First operand has 117 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 74 states have internal predecessors, (97), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-16 13:18:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:30,511 INFO L93 Difference]: Finished difference Result 226 states and 392 transitions. [2024-11-16 13:18:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:18:30,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 260 [2024-11-16 13:18:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:30,523 INFO L225 Difference]: With dead ends: 226 [2024-11-16 13:18:30,523 INFO L226 Difference]: Without dead ends: 112 [2024-11-16 13:18:30,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-16 13:18:30,531 INFO L432 NwaCegarLoop]: 169 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, 169 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-16 13:18:30,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:18:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-16 13:18:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-16 13:18:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-16 13:18:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 171 transitions. [2024-11-16 13:18:30,599 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 171 transitions. Word has length 260 [2024-11-16 13:18:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:30,599 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 171 transitions. [2024-11-16 13:18:30,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-16 13:18:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 171 transitions. [2024-11-16 13:18:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-16 13:18:30,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:30,610 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:30,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:18:30,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:30,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:30,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1106409104, now seen corresponding path program 1 times [2024-11-16 13:18:30,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:30,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750360999] [2024-11-16 13:18:30,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:30,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:18:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:18:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:18:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 13:18:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:18:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:18:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:18:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:18:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:18:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:18:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:18:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:18:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:18:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-16 13:18:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:18:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-16 13:18:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:18:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-16 13:18:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-16 13:18:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-16 13:18:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-16 13:18:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-16 13:18:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-16 13:18:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-16 13:18:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-16 13:18:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-16 13:18:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:31,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750360999] [2024-11-16 13:18:31,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750360999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:31,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:31,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:18:31,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731370853] [2024-11-16 13:18:31,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:31,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:18:31,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:31,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:18:31,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:18:31,471 INFO L87 Difference]: Start difference. First operand 112 states and 171 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-16 13:18:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:31,774 INFO L93 Difference]: Finished difference Result 309 states and 465 transitions. [2024-11-16 13:18:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:18:31,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 260 [2024-11-16 13:18:31,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:31,783 INFO L225 Difference]: With dead ends: 309 [2024-11-16 13:18:31,783 INFO L226 Difference]: Without dead ends: 200 [2024-11-16 13:18:31,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 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-16 13:18:31,787 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 201 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:18:31,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 493 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:18:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-16 13:18:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 196. [2024-11-16 13:18:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 126 states have (on average 1.2857142857142858) internal successors, (162), 127 states have internal predecessors, (162), 65 states have call successors, (65), 4 states have call predecessors, (65), 4 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-16 13:18:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 292 transitions. [2024-11-16 13:18:31,847 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 292 transitions. Word has length 260 [2024-11-16 13:18:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:31,848 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 292 transitions. [2024-11-16 13:18:31,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-16 13:18:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 292 transitions. [2024-11-16 13:18:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-16 13:18:31,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:31,861 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:31,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:18:31,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:31,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash -970800239, now seen corresponding path program 1 times [2024-11-16 13:18:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:31,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813262730] [2024-11-16 13:18:31,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:31,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat