./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-fpi/brs1.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 1719c559f228c1029533750a96ea896ed07efcc9b139440443e471db2c10d1e7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:12:16,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:12:16,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:12:16,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:12:16,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:12:16,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:12:16,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:12:16,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:12:16,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:12:16,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:12:16,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:12:16,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:12:16,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:12:16,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:12:16,458 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:12:16,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:12:16,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:12:16,459 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:12:16,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:12:16,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:12:16,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:12:16,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:12:16,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:12:16,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:12:16,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:12:16,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:12:16,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:12:16,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:12:16,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:12:16,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:12:16,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:12:16,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:12:16,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:12:16,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:12:16,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:12:16,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:12:16,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:12:16,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:12:16,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:12:16,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:12:16,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:12:16,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:12:16,470 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 -> 1719c559f228c1029533750a96ea896ed07efcc9b139440443e471db2c10d1e7 [2024-11-08 10:12:16,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:12:16,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:12:16,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:12:16,818 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:12:16,819 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:12:16,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs1.c [2024-11-08 10:12:18,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:12:18,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:12:18,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs1.c [2024-11-08 10:12:18,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f38354ac/3bdedef13c634e7a9269b834daf6ca38/FLAG79efbc6e0 [2024-11-08 10:12:18,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f38354ac/3bdedef13c634e7a9269b834daf6ca38 [2024-11-08 10:12:18,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:12:18,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:12:18,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:12:18,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:12:18,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:12:18,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b087840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18, skipping insertion in model container [2024-11-08 10:12:18,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:12:18,790 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-fpi/brs1.c[587,600] [2024-11-08 10:12:18,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:12:18,818 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:12:18,829 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-fpi/brs1.c[587,600] [2024-11-08 10:12:18,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:12:18,852 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:12:18,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18 WrapperNode [2024-11-08 10:12:18,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:12:18,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:12:18,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:12:18,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:12:18,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,891 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-11-08 10:12:18,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:12:18,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:12:18,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:12:18,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:12:18,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,924 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 7, 4, 3]. 44 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2024-11-08 10:12:18,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:12:18,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:12:18,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:12:18,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:12:18,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (1/1) ... [2024-11-08 10:12:18,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:12:18,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:12:19,045 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-08 10:12:19,049 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-08 10:12:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:12:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:12:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 10:12:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 10:12:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 10:12:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 10:12:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 10:12:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 10:12:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 10:12:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 10:12:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 10:12:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:12:19,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:12:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 10:12:19,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 10:12:19,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 10:12:19,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 10:12:19,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 10:12:19,169 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:12:19,171 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:12:19,345 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 10:12:19,346 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:12:19,359 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:12:19,360 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 10:12:19,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:12:19 BoogieIcfgContainer [2024-11-08 10:12:19,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:12:19,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:12:19,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:12:19,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:12:19,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:12:18" (1/3) ... [2024-11-08 10:12:19,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3604b015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:12:19, skipping insertion in model container [2024-11-08 10:12:19,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:12:18" (2/3) ... [2024-11-08 10:12:19,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3604b015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:12:19, skipping insertion in model container [2024-11-08 10:12:19,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:12:19" (3/3) ... [2024-11-08 10:12:19,371 INFO L112 eAbstractionObserver]: Analyzing ICFG brs1.c [2024-11-08 10:12:19,387 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:12:19,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:12:19,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:12:19,468 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;@6f97f056, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:12:19,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:12:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 10:12:19,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:12:19,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:12:19,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:12:19,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:12:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2024-11-08 10:12:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:12:19,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032583112] [2024-11-08 10:12:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:19,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:12:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:19,644 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-08 10:12:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:12:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032583112] [2024-11-08 10:12:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032583112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:12:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:12:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:12:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802025702] [2024-11-08 10:12:19,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:12:19,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 10:12:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:12:19,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 10:12:19,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 10:12:19,677 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:12:19,688 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2024-11-08 10:12:19,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 10:12:19,690 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 10:12:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:12:19,695 INFO L225 Difference]: With dead ends: 36 [2024-11-08 10:12:19,696 INFO L226 Difference]: Without dead ends: 16 [2024-11-08 10:12:19,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-08 10:12:19,700 INFO L432 NwaCegarLoop]: 23 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, 23 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-08 10:12:19,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:12:19,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-08 10:12:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-08 10:12:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-08 10:12:19,727 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2024-11-08 10:12:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:12:19,727 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-08 10:12:19,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-08 10:12:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 10:12:19,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:12:19,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:12:19,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:12:19,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:12:19,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:12:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2024-11-08 10:12:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:12:19,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119243813] [2024-11-08 10:12:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:12:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:19,910 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-08 10:12:19,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:12:19,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119243813] [2024-11-08 10:12:19,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119243813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:12:19,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:12:19,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:12:19,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284066580] [2024-11-08 10:12:19,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:12:19,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:12:19,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:12:19,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:12:19,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:12:19,915 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:12:19,992 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-08 10:12:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:12:19,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 10:12:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:12:19,994 INFO L225 Difference]: With dead ends: 30 [2024-11-08 10:12:19,995 INFO L226 Difference]: Without dead ends: 22 [2024-11-08 10:12:19,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-08 10:12:19,997 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:12:19,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 11 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:12:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-08 10:12:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-08 10:12:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-08 10:12:20,002 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2024-11-08 10:12:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:12:20,003 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-08 10:12:20,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-08 10:12:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 10:12:20,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:12:20,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:12:20,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:12:20,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:12:20,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:12:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2024-11-08 10:12:20,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:12:20,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495157743] [2024-11-08 10:12:20,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:20,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:12:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 10:12:20,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:12:20,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495157743] [2024-11-08 10:12:20,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495157743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:12:20,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:12:20,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 10:12:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863123576] [2024-11-08 10:12:20,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:12:20,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:12:20,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:12:20,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:12:20,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:12:20,336 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:12:20,395 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-11-08 10:12:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:12:20,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 10:12:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:12:20,400 INFO L225 Difference]: With dead ends: 26 [2024-11-08 10:12:20,400 INFO L226 Difference]: Without dead ends: 22 [2024-11-08 10:12:20,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:12:20,402 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:12:20,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:12:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-08 10:12:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-08 10:12:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-11-08 10:12:20,413 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2024-11-08 10:12:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:12:20,414 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-08 10:12:20,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-11-08 10:12:20,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 10:12:20,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:12:20,416 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:12:20,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:12:20,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:12:20,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:12:20,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1654199858, now seen corresponding path program 1 times [2024-11-08 10:12:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:12:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422744264] [2024-11-08 10:12:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:12:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:20,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:12:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422744264] [2024-11-08 10:12:20,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422744264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:12:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036186156] [2024-11-08 10:12:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:20,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:20,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:12:20,635 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-08 10:12:20,637 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-08 10:12:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:20,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 10:12:20,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:12:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:20,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:12:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:20,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036186156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:12:20,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:12:20,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-08 10:12:20,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998511886] [2024-11-08 10:12:20,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:12:20,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 10:12:20,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:12:20,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 10:12:20,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:12:20,909 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:12:20,997 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-08 10:12:20,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 10:12:20,998 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-08 10:12:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:12:20,999 INFO L225 Difference]: With dead ends: 42 [2024-11-08 10:12:20,999 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 10:12:20,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:12:21,000 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:12:21,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:12:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 10:12:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-11-08 10:12:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-08 10:12:21,012 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2024-11-08 10:12:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:12:21,012 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-08 10:12:21,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-08 10:12:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 10:12:21,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:12:21,013 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:12:21,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:12:21,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:21,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:12:21,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:12:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1179965024, now seen corresponding path program 2 times [2024-11-08 10:12:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:12:21,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507000642] [2024-11-08 10:12:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:12:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:21,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:12:21,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507000642] [2024-11-08 10:12:21,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507000642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:12:21,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000420183] [2024-11-08 10:12:21,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:12:21,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:21,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:12:21,906 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-08 10:12:21,907 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-08 10:12:21,982 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 10:12:21,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:12:21,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 10:12:21,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:12:22,173 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 23 treesize of output 1 [2024-11-08 10:12:22,372 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-08 10:12:22,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:12:22,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-11-08 10:12:22,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-08 10:12:22,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 10:12:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:22,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:12:22,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2024-11-08 10:12:23,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-08 10:12:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:23,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000420183] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:12:23,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:12:23,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 36 [2024-11-08 10:12:23,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288888647] [2024-11-08 10:12:23,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:12:23,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-08 10:12:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:12:23,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-08 10:12:23,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 10:12:23,122 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:12:24,290 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-08 10:12:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 10:12:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-08 10:12:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:12:24,291 INFO L225 Difference]: With dead ends: 44 [2024-11-08 10:12:24,292 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 10:12:24,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=721, Invalid=2939, Unknown=0, NotChecked=0, Total=3660 [2024-11-08 10:12:24,294 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 82 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:12:24,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 45 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:12:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 10:12:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-08 10:12:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-08 10:12:24,300 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2024-11-08 10:12:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:12:24,301 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-08 10:12:24,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-08 10:12:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 10:12:24,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:12:24,302 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:12:24,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 10:12:24,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:24,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:12:24,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:12:24,507 INFO L85 PathProgramCache]: Analyzing trace with hash 500482496, now seen corresponding path program 3 times [2024-11-08 10:12:24,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:12:24,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362665266] [2024-11-08 10:12:24,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:24,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:12:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:24,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:12:24,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362665266] [2024-11-08 10:12:24,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362665266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:12:24,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440563218] [2024-11-08 10:12:24,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 10:12:24,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:12:24,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:12:24,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:12:24,705 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 10:12:24,705 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:12:24,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 10:12:24,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:12:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 10:12:24,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:12:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 10:12:24,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440563218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:12:24,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:12:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 24 [2024-11-08 10:12:24,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402322906] [2024-11-08 10:12:24,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:12:24,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 10:12:24,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:12:24,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 10:12:24,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2024-11-08 10:12:24,974 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:12:25,170 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2024-11-08 10:12:25,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 10:12:25,171 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-08 10:12:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:12:25,172 INFO L225 Difference]: With dead ends: 53 [2024-11-08 10:12:25,172 INFO L226 Difference]: Without dead ends: 35 [2024-11-08 10:12:25,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2024-11-08 10:12:25,173 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:12:25,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 50 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:12:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-08 10:12:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-08 10:12:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-08 10:12:25,180 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2024-11-08 10:12:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:12:25,180 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-08 10:12:25,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-08 10:12:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 10:12:25,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:12:25,181 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:12:25,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 10:12:25,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:25,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:12:25,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:12:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash 900913518, now seen corresponding path program 4 times [2024-11-08 10:12:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:12:25,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049722548] [2024-11-08 10:12:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:25,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:12:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:25,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:12:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049722548] [2024-11-08 10:12:25,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049722548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:12:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715114284] [2024-11-08 10:12:25,569 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 10:12:25,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:25,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:12:25,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:12:25,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:12:25,628 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 10:12:25,629 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:12:25,630 WARN L253 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 10:12:25,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:12:25,642 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 23 treesize of output 1 [2024-11-08 10:12:25,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-08 10:12:25,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2024-11-08 10:12:25,921 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-08 10:12:26,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 10:12:26,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-08 10:12:26,400 INFO L349 Elim1Store]: treesize reduction 26, result has 70.1 percent of original size [2024-11-08 10:12:26,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 96 [2024-11-08 10:12:26,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 61 [2024-11-08 10:12:26,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 10:12:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:26,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:12:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:27,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715114284] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:12:27,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:12:27,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 22] total 50 [2024-11-08 10:12:27,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288665292] [2024-11-08 10:12:27,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:12:27,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-08 10:12:27,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:12:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-08 10:12:27,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2149, Unknown=0, NotChecked=0, Total=2450 [2024-11-08 10:12:27,638 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 50 states, 50 states have (on average 1.66) internal successors, (83), 50 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:12:30,254 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2024-11-08 10:12:30,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-08 10:12:30,254 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.66) internal successors, (83), 50 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-08 10:12:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:12:30,255 INFO L225 Difference]: With dead ends: 62 [2024-11-08 10:12:30,255 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 10:12:30,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1216, Invalid=6974, Unknown=0, NotChecked=0, Total=8190 [2024-11-08 10:12:30,262 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 75 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:12:30,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 109 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:12:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 10:12:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-08 10:12:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-08 10:12:30,277 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 32 [2024-11-08 10:12:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:12:30,277 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-08 10:12:30,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.66) internal successors, (83), 50 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-08 10:12:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 10:12:30,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:12:30,279 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:12:30,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 10:12:30,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:30,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:12:30,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:12:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 876019369, now seen corresponding path program 5 times [2024-11-08 10:12:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:12:30,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756471571] [2024-11-08 10:12:30,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:12:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:30,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:12:30,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756471571] [2024-11-08 10:12:30,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756471571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:12:30,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576052568] [2024-11-08 10:12:30,664 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 10:12:30,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:30,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:12:30,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:12:30,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:12:30,754 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-08 10:12:30,754 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:12:30,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 10:12:30,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:12:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:30,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:12:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576052568] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:12:30,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:12:30,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-08 10:12:30,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102497535] [2024-11-08 10:12:30,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:12:30,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 10:12:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:12:30,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 10:12:30,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2024-11-08 10:12:30,969 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:12:31,088 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2024-11-08 10:12:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 10:12:31,089 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-08 10:12:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:12:31,089 INFO L225 Difference]: With dead ends: 67 [2024-11-08 10:12:31,089 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 10:12:31,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2024-11-08 10:12:31,090 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:12:31,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 35 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:12:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 10:12:31,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-11-08 10:12:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-11-08 10:12:31,104 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2024-11-08 10:12:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:12:31,104 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-11-08 10:12:31,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-11-08 10:12:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 10:12:31,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:12:31,105 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:12:31,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 10:12:31,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:31,306 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:12:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:12:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1188189509, now seen corresponding path program 6 times [2024-11-08 10:12:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:12:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629885616] [2024-11-08 10:12:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:12:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:33,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:12:33,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629885616] [2024-11-08 10:12:33,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629885616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:12:33,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932115423] [2024-11-08 10:12:33,027 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 10:12:33,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:33,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:12:33,029 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:12:33,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:12:33,149 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-11-08 10:12:33,149 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:12:33,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 10:12:33,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:12:33,178 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 15 treesize of output 1 [2024-11-08 10:12:33,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 10:12:33,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-08 10:12:33,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-08 10:12:33,604 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-08 10:12:33,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-08 10:12:33,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-08 10:12:34,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-08 10:12:34,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-11-08 10:12:34,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:12:34,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 24 [2024-11-08 10:12:34,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 10:12:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:34,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:12:35,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2024-11-08 10:12:35,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:12:35,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2778 treesize of output 2330 [2024-11-08 10:12:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:35,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932115423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:12:35,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:12:35,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28, 28] total 75 [2024-11-08 10:12:35,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325321321] [2024-11-08 10:12:35,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:12:35,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-11-08 10:12:35,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:12:35,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-11-08 10:12:35,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=915, Invalid=4635, Unknown=0, NotChecked=0, Total=5550 [2024-11-08 10:12:35,649 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 75 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:12:38,889 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-08 10:12:38,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-08 10:12:38,889 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-08 10:12:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:12:38,890 INFO L225 Difference]: With dead ends: 93 [2024-11-08 10:12:38,890 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 10:12:38,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5425 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3044, Invalid=14248, Unknown=0, NotChecked=0, Total=17292 [2024-11-08 10:12:38,895 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 262 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:12:38,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 153 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:12:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 10:12:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 63. [2024-11-08 10:12:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2024-11-08 10:12:38,919 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 41 [2024-11-08 10:12:38,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:12:38,922 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2024-11-08 10:12:38,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:12:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2024-11-08 10:12:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 10:12:38,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:12:38,923 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:12:38,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 10:12:39,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:39,124 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:12:39,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:12:39,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1528150112, now seen corresponding path program 7 times [2024-11-08 10:12:39,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:12:39,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222099456] [2024-11-08 10:12:39,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:12:39,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:12:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 3 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:41,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:12:41,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222099456] [2024-11-08 10:12:41,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222099456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:12:41,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227727661] [2024-11-08 10:12:41,479 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 10:12:41,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:12:41,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:12:41,481 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:12:41,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:12:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:12:41,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 10:12:41,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:12:41,584 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 15 treesize of output 1 [2024-11-08 10:12:41,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 10:12:41,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-08 10:12:41,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-08 10:12:41,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2024-11-08 10:12:42,059 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-08 10:12:42,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-08 10:12:42,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-08 10:12:42,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-08 10:12:42,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-11-08 10:12:42,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2024-11-08 10:12:42,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:12:42,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 28 [2024-11-08 10:12:42,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 10:12:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:12:42,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:12:44,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 225 [2024-11-08 10:12:56,712 WARN L286 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 1 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-08 10:12:56,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:12:57,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103919543803206006 treesize of output 101104794036099446