./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.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 35897ca10739dfe50f578706614b96ade5d7e66bf9cbebf31dd49bae05c8bb42 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:05:39,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:05:39,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:05:39,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:05:39,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:05:39,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:05:39,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:05:39,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:05:39,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:05:39,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:05:39,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:05:39,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:05:39,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:05:39,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:05:39,391 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:05:39,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:05:39,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:05:39,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:05:39,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:05:39,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:05:39,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:05:39,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:05:39,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:05:39,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:05:39,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:05:39,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:05:39,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:05:39,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:05:39,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:05:39,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:05:39,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:05:39,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:05:39,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:05:39,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:05:39,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:05:39,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:05:39,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:05:39,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:05:39,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:05:39,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:05:39,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:05:39,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:05:39,407 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 -> 35897ca10739dfe50f578706614b96ade5d7e66bf9cbebf31dd49bae05c8bb42 [2024-11-12 06:05:39,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:05:39,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:05:39,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:05:39,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:05:39,769 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:05:39,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.i [2024-11-12 06:05:41,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:05:41,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:05:41,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.i [2024-11-12 06:05:41,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8769d07/19a273bf67c34e9cbeb3fe45604a19f9/FLAGe4d3c07e7 [2024-11-12 06:05:41,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8769d07/19a273bf67c34e9cbeb3fe45604a19f9 [2024-11-12 06:05:41,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:05:41,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:05:41,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:05:41,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:05:41,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:05:41,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:05:41" (1/1) ... [2024-11-12 06:05:41,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cccc757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:41, skipping insertion in model container [2024-11-12 06:05:41,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:05:41" (1/1) ... [2024-11-12 06:05:41,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:05:41,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.i[916,929] [2024-11-12 06:05:42,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:05:42,122 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:05:42,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-57.i[916,929] [2024-11-12 06:05:42,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:05:42,196 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:05:42,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42 WrapperNode [2024-11-12 06:05:42,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:05:42,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:05:42,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:05:42,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:05:42,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,275 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2024-11-12 06:05:42,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:05:42,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:05:42,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:05:42,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:05:42,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,337 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:05:42,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:05:42,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:05:42,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:05:42,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:05:42,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (1/1) ... [2024-11-12 06:05:42,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:05:42,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:05:42,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:05:42,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:05:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:05:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:05:42,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:05:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:05:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:05:42,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:05:42,657 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:05:42,661 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:05:43,291 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-12 06:05:43,291 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:05:43,320 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:05:43,321 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:05:43,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:05:43 BoogieIcfgContainer [2024-11-12 06:05:43,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:05:43,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:05:43,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:05:43,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:05:43,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:05:41" (1/3) ... [2024-11-12 06:05:43,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea08f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:05:43, skipping insertion in model container [2024-11-12 06:05:43,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:05:42" (2/3) ... [2024-11-12 06:05:43,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea08f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:05:43, skipping insertion in model container [2024-11-12 06:05:43,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:05:43" (3/3) ... [2024-11-12 06:05:43,335 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-57.i [2024-11-12 06:05:43,356 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:05:43,357 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:05:43,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:05:43,511 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;@4844099, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:05:43,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:05:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 73 states have internal predecessors, (105), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:05:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-12 06:05:43,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:05:43,548 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:05:43,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:05:43,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:05:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash -995895122, now seen corresponding path program 1 times [2024-11-12 06:05:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:05:43,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880731924] [2024-11-12 06:05:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:05:43,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:05:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:43,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:05:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:05:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:05:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:05:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:05:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:05:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:05:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:05:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:05:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:05:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:05:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:05:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:05:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:05:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:05:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:05:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 06:05:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:05:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 06:05:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:05:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-12 06:05:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 06:05:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 06:05:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 06:05:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 06:05:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 06:05:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 06:05:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 06:05:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 06:05:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 06:05:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 06:05:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 06:05:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 06:05:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 06:05:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 06:05:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 06:05:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:05:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-12 06:05:44,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:05:44,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880731924] [2024-11-12 06:05:44,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880731924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:05:44,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:05:44,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:05:44,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496153534] [2024-11-12 06:05:44,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:05:44,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:05:44,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:05:44,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:05:44,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:05:44,378 INFO L87 Difference]: Start difference. First operand has 111 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 73 states have internal predecessors, (105), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-12 06:05:44,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:05:44,436 INFO L93 Difference]: Finished difference Result 215 states and 384 transitions. [2024-11-12 06:05:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:05:44,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 227 [2024-11-12 06:05:44,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:05:44,452 INFO L225 Difference]: With dead ends: 215 [2024-11-12 06:05:44,453 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 06:05:44,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:05:44,466 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:05:44,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:05:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 06:05:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-12 06:05:44,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 06:05:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 170 transitions. [2024-11-12 06:05:44,541 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 170 transitions. Word has length 227 [2024-11-12 06:05:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:05:44,542 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 170 transitions. [2024-11-12 06:05:44,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-12 06:05:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 170 transitions. [2024-11-12 06:05:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-12 06:05:44,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:05:44,549 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:05:44,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:05:44,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:05:44,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:05:44,551 INFO L85 PathProgramCache]: Analyzing trace with hash -43048154, now seen corresponding path program 1 times [2024-11-12 06:05:44,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:05:44,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377872496] [2024-11-12 06:05:44,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:05:44,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:05:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:06:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:06:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:06:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:06:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:06:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:06:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:06:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:06:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:06:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:06:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:06:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:06:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:06:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 06:06:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:06:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 06:06:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 06:06:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:06:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 06:06:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:06:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:14,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-12 06:06:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 06:06:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 06:06:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 06:06:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 06:06:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 06:06:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 06:06:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 06:06:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 06:06:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 06:06:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 06:06:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 06:06:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-12 06:06:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 06:06:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 06:06:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 06:06:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:06:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-12 06:06:15,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:06:15,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377872496] [2024-11-12 06:06:15,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377872496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:06:15,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:06:15,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 06:06:15,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801113620] [2024-11-12 06:06:15,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:06:15,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 06:06:15,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:06:15,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 06:06:15,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 06:06:15,110 INFO L87 Difference]: Start difference. First operand 107 states and 170 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-12 06:06:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:06:18,006 INFO L93 Difference]: Finished difference Result 431 states and 683 transitions. [2024-11-12 06:06:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 06:06:18,007 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2024-11-12 06:06:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:06:18,015 INFO L225 Difference]: With dead ends: 431 [2024-11-12 06:06:18,016 INFO L226 Difference]: Without dead ends: 327 [2024-11-12 06:06:18,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-12 06:06:18,023 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 476 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-12 06:06:18,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 744 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-12 06:06:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-12 06:06:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 194. [2024-11-12 06:06:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-12 06:06:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 310 transitions. [2024-11-12 06:06:18,085 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 310 transitions. Word has length 227 [2024-11-12 06:06:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:06:18,086 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 310 transitions. [2024-11-12 06:06:18,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-12 06:06:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 310 transitions. [2024-11-12 06:06:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-12 06:06:18,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:06:18,099 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:06:18,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:06:18,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:06:18,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:06:18,101 INFO L85 PathProgramCache]: Analyzing trace with hash -78260750, now seen corresponding path program 1 times [2024-11-12 06:06:18,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:06:18,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103769874] [2024-11-12 06:06:18,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:06:18,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:06:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat