./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array17_pattern.c --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/array-patterns/array17_pattern.c -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 1bbdbab39b20ef0f9bb51ea0fb71bf773586866898cf5babc34262381f9b9103 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 02:45:27,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 02:45:27,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 02:45:27,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 02:45:27,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 02:45:27,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 02:45:27,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 02:45:27,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 02:45:27,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 02:45:27,453 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 02:45:27,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 02:45:27,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 02:45:27,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 02:45:27,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 02:45:27,455 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 02:45:27,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 02:45:27,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 02:45:27,455 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 02:45:27,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 02:45:27,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 02:45:27,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 02:45:27,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 02:45:27,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 02:45:27,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 02:45:27,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 02:45:27,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 02:45:27,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 02:45:27,458 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 02:45:27,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 02:45:27,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 02:45:27,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 02:45:27,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 02:45:27,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 02:45:27,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 02:45:27,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 02:45:27,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 02:45:27,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 02:45:27,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 02:45:27,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 02:45:27,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 02:45:27,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 02:45:27,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 02:45:27,462 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 -> 1bbdbab39b20ef0f9bb51ea0fb71bf773586866898cf5babc34262381f9b9103 [2024-11-16 02:45:27,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 02:45:27,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 02:45:27,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 02:45:27,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 02:45:27,686 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 02:45:27,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array17_pattern.c [2024-11-16 02:45:29,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 02:45:29,186 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 02:45:29,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array17_pattern.c [2024-11-16 02:45:29,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5438b92e/e62ab39b3cd84a428b5cba1b44a47710/FLAG83d03022d [2024-11-16 02:45:29,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5438b92e/e62ab39b3cd84a428b5cba1b44a47710 [2024-11-16 02:45:29,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 02:45:29,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 02:45:29,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 02:45:29,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 02:45:29,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 02:45:29,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@542eb672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29, skipping insertion in model container [2024-11-16 02:45:29,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 02:45:29,355 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/array-patterns/array17_pattern.c[1441,1454] [2024-11-16 02:45:29,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 02:45:29,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 02:45:29,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array17_pattern.c[1441,1454] [2024-11-16 02:45:29,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 02:45:29,406 INFO L204 MainTranslator]: Completed translation [2024-11-16 02:45:29,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29 WrapperNode [2024-11-16 02:45:29,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 02:45:29,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 02:45:29,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 02:45:29,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 02:45:29,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,432 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2024-11-16 02:45:29,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 02:45:29,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 02:45:29,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 02:45:29,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 02:45:29,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,479 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-16 02:45:29,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 02:45:29,503 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 02:45:29,503 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 02:45:29,503 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 02:45:29,504 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (1/1) ... [2024-11-16 02:45:29,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 02:45:29,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:45:29,572 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 02:45:29,577 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 02:45:29,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 02:45:29,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 02:45:29,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 02:45:29,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 02:45:29,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 02:45:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 02:45:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 02:45:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 02:45:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 02:45:29,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 02:45:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 02:45:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 02:45:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 02:45:29,699 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 02:45:29,701 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 02:45:29,854 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L46: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2024-11-16 02:45:29,877 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-16 02:45:29,877 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 02:45:29,889 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 02:45:29,889 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 02:45:29,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:45:29 BoogieIcfgContainer [2024-11-16 02:45:29,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 02:45:29,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 02:45:29,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 02:45:29,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 02:45:29,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:45:29" (1/3) ... [2024-11-16 02:45:29,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7461bde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:45:29, skipping insertion in model container [2024-11-16 02:45:29,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:45:29" (2/3) ... [2024-11-16 02:45:29,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7461bde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:45:29, skipping insertion in model container [2024-11-16 02:45:29,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:45:29" (3/3) ... [2024-11-16 02:45:29,895 INFO L112 eAbstractionObserver]: Analyzing ICFG array17_pattern.c [2024-11-16 02:45:29,907 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 02:45:29,907 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 02:45:29,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 02:45:29,957 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;@15d165d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 02:45:29,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 02:45:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:45:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 02:45:29,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:45:29,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 02:45:29,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:45:29,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:45:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash 327308478, now seen corresponding path program 1 times [2024-11-16 02:45:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:45:29,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153941573] [2024-11-16 02:45:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:45:29,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:45:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 02:45:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 02:45:30,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:45:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153941573] [2024-11-16 02:45:30,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153941573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 02:45:30,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 02:45:30,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 02:45:30,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635872174] [2024-11-16 02:45:30,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 02:45:30,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 02:45:30,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:45:30,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 02:45:30,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 02:45:30,150 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 02:45:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:45:30,166 INFO L93 Difference]: Finished difference Result 72 states and 106 transitions. [2024-11-16 02:45:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 02:45:30,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-16 02:45:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:45:30,172 INFO L225 Difference]: With dead ends: 72 [2024-11-16 02:45:30,173 INFO L226 Difference]: Without dead ends: 33 [2024-11-16 02:45:30,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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 02:45:30,177 INFO L432 NwaCegarLoop]: 45 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, 45 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-16 02:45:30,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:45:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-16 02:45:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-16 02:45:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:45:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-16 02:45:30,205 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 16 [2024-11-16 02:45:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:45:30,206 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-16 02:45:30,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 02:45:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-16 02:45:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 02:45:30,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:45:30,208 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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 02:45:30,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 02:45:30,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:45:30,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:45:30,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1773980284, now seen corresponding path program 1 times [2024-11-16 02:45:30,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:45:30,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380383234] [2024-11-16 02:45:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:45:30,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:45:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 02:45:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 02:45:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 02:45:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 02:45:30,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:45:30,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380383234] [2024-11-16 02:45:30,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380383234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 02:45:30,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 02:45:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 02:45:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47958572] [2024-11-16 02:45:30,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 02:45:30,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 02:45:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:45:30,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 02:45:30,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 02:45:30,360 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 02:45:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:45:30,390 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2024-11-16 02:45:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 02:45:30,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-16 02:45:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:45:30,393 INFO L225 Difference]: With dead ends: 60 [2024-11-16 02:45:30,393 INFO L226 Difference]: Without dead ends: 36 [2024-11-16 02:45:30,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 02:45:30,394 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 02:45:30,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:45:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-16 02:45:30,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-16 02:45:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:45:30,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-16 02:45:30,403 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 34 [2024-11-16 02:45:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:45:30,404 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-16 02:45:30,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 02:45:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-16 02:45:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 02:45:30,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:45:30,406 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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 02:45:30,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 02:45:30,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:45:30,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:45:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1577466779, now seen corresponding path program 1 times [2024-11-16 02:45:30,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:45:30,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159912663] [2024-11-16 02:45:30,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:45:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:45:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 02:45:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 02:45:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 02:45:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 02:45:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:45:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159912663] [2024-11-16 02:45:30,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159912663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 02:45:30,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 02:45:30,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 02:45:30,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108229864] [2024-11-16 02:45:30,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 02:45:30,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 02:45:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:45:30,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 02:45:30,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 02:45:30,566 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 02:45:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:45:30,579 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-11-16 02:45:30,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 02:45:30,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-11-16 02:45:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:45:30,580 INFO L225 Difference]: With dead ends: 45 [2024-11-16 02:45:30,581 INFO L226 Difference]: Without dead ends: 40 [2024-11-16 02:45:30,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 02:45:30,582 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 02:45:30,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 94 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:45:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-16 02:45:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-16 02:45:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:45:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-11-16 02:45:30,590 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 34 [2024-11-16 02:45:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:45:30,591 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-16 02:45:30,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 02:45:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2024-11-16 02:45:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 02:45:30,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:45:30,595 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 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 02:45:30,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 02:45:30,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:45:30,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:45:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1857607401, now seen corresponding path program 1 times [2024-11-16 02:45:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:45:30,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476552273] [2024-11-16 02:45:30,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:45:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:45:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 02:45:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 02:45:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 02:45:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 02:45:30,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:45:30,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476552273] [2024-11-16 02:45:30,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476552273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 02:45:30,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 02:45:30,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 02:45:30,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115331449] [2024-11-16 02:45:30,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 02:45:30,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 02:45:30,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:45:30,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 02:45:30,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 02:45:30,747 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 02:45:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:45:30,858 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-11-16 02:45:30,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 02:45:30,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-16 02:45:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:45:30,859 INFO L225 Difference]: With dead ends: 86 [2024-11-16 02:45:30,859 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 02:45:30,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 02:45:30,860 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 02:45:30,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 98 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 02:45:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 02:45:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2024-11-16 02:45:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:45:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-16 02:45:30,867 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 41 [2024-11-16 02:45:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:45:30,868 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-16 02:45:30,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 02:45:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-16 02:45:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 02:45:30,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:45:30,869 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 02:45:30,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 02:45:30,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:45:30,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:45:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1958261880, now seen corresponding path program 1 times [2024-11-16 02:45:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:45:30,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112657407] [2024-11-16 02:45:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:45:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:45:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 02:45:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 02:45:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 02:45:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 02:45:30,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:45:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112657407] [2024-11-16 02:45:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112657407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 02:45:30,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 02:45:30,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 02:45:30,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714350032] [2024-11-16 02:45:30,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 02:45:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 02:45:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:45:30,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 02:45:30,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 02:45:30,943 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 02:45:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:45:30,982 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2024-11-16 02:45:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 02:45:30,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-16 02:45:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:45:30,984 INFO L225 Difference]: With dead ends: 85 [2024-11-16 02:45:30,984 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 02:45:30,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 02:45:30,986 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 02:45:30,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 02:45:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 02:45:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2024-11-16 02:45:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 02:45:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-16 02:45:30,996 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 46 [2024-11-16 02:45:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:45:30,996 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-16 02:45:30,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 02:45:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-16 02:45:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 02:45:31,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:45:31,000 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 02:45:31,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 02:45:31,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:45:31,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:45:31,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1348456585, now seen corresponding path program 1 times [2024-11-16 02:45:31,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:45:31,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692783048] [2024-11-16 02:45:31,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:45:31,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:45:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:31,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 02:45:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 02:45:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:31,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 02:45:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 02:45:31,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 02:45:31,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692783048] [2024-11-16 02:45:31,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692783048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 02:45:31,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896781577] [2024-11-16 02:45:31,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:45:31,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:45:31,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:45:31,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 02:45:31,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 02:45:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:31,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 02:45:31,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 02:45:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 02:45:31,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 02:45:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 02:45:31,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896781577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 02:45:31,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 02:45:31,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 23 [2024-11-16 02:45:31,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603410283] [2024-11-16 02:45:31,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 02:45:31,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 02:45:31,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 02:45:31,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 02:45:31,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2024-11-16 02:45:31,847 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-16 02:45:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 02:45:32,431 INFO L93 Difference]: Finished difference Result 213 states and 260 transitions. [2024-11-16 02:45:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-16 02:45:32,433 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 48 [2024-11-16 02:45:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 02:45:32,435 INFO L225 Difference]: With dead ends: 213 [2024-11-16 02:45:32,437 INFO L226 Difference]: Without dead ends: 178 [2024-11-16 02:45:32,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1042, Unknown=0, NotChecked=0, Total=1332 [2024-11-16 02:45:32,438 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 246 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 02:45:32,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 549 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 02:45:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-16 02:45:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 98. [2024-11-16 02:45:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 89 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 02:45:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2024-11-16 02:45:32,465 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 48 [2024-11-16 02:45:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 02:45:32,465 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2024-11-16 02:45:32,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-16 02:45:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2024-11-16 02:45:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 02:45:32,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 02:45:32,467 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 02:45:32,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 02:45:32,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 02:45:32,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 02:45:32,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 02:45:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1857294411, now seen corresponding path program 1 times [2024-11-16 02:45:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 02:45:32,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311607601] [2024-11-16 02:45:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:45:32,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 02:45:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 02:45:32,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215617399] [2024-11-16 02:45:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 02:45:32,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 02:45:32,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 02:45:32,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 02:45:32,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 02:45:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 02:45:32,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-16 02:45:32,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 02:45:32,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 02:45:33,146 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-16 02:45:33,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 18 [2024-11-16 02:45:33,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 02:45:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 02:45:33,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 02:46:03,063 WARN L286 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 02:46:30,418 WARN L286 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 02:46:49,224 WARN L286 SmtUtils]: Spent 7.26s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 02:47:02,749 WARN L286 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)