./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.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 185af411ffb66b9762afca1cabf119211700e2cdb0b48054cece4906f7290e44 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:45:29,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:45:30,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:45:30,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:45:30,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:45:30,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:45:30,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:45:30,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:45:30,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:45:30,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:45:30,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:45:30,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:45:30,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:45:30,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:45:30,076 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:45:30,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:45:30,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:45:30,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:45:30,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:45:30,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:45:30,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:45:30,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:45:30,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:45:30,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:45:30,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:45:30,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:45:30,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:45:30,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:45:30,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:45:30,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:45:30,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:45:30,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:45:30,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:45:30,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:45:30,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:45:30,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:45:30,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:45:30,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:45:30,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:45:30,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:45:30,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:45:30,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:45:30,088 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 -> 185af411ffb66b9762afca1cabf119211700e2cdb0b48054cece4906f7290e44 [2024-10-12 18:45:30,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:45:30,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:45:30,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:45:30,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:45:30,377 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:45:30,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c [2024-10-12 18:45:31,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:45:31,990 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:45:31,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c [2024-10-12 18:45:31,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a80627b3/a1ef7cdb7518434385e5aa3d3a70b2a9/FLAG460e6122b [2024-10-12 18:45:32,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a80627b3/a1ef7cdb7518434385e5aa3d3a70b2a9 [2024-10-12 18:45:32,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:45:32,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:45:32,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:45:32,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:45:32,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:45:32,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bef2f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32, skipping insertion in model container [2024-10-12 18:45:32,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:45:32,585 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c[525,538] [2024-10-12 18:45:32,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:45:32,619 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:45:32,628 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound2.c[525,538] [2024-10-12 18:45:32,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:45:32,659 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:45:32,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32 WrapperNode [2024-10-12 18:45:32,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:45:32,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:45:32,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:45:32,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:45:32,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,693 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2024-10-12 18:45:32,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:45:32,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:45:32,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:45:32,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:45:32,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,722 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 18:45:32,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:45:32,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:45:32,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:45:32,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:45:32,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (1/1) ... [2024-10-12 18:45:32,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:45:32,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:45:32,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:45:32,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:45:32,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:45:32,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 18:45:32,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 18:45:32,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:45:32,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:45:32,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:45:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 18:45:32,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 18:45:32,913 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:45:32,915 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:45:33,123 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-12 18:45:33,123 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:45:33,144 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:45:33,144 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 18:45:33,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:45:33 BoogieIcfgContainer [2024-10-12 18:45:33,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:45:33,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:45:33,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:45:33,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:45:33,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:45:32" (1/3) ... [2024-10-12 18:45:33,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b5b143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:45:33, skipping insertion in model container [2024-10-12 18:45:33,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:45:32" (2/3) ... [2024-10-12 18:45:33,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b5b143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:45:33, skipping insertion in model container [2024-10-12 18:45:33,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:45:33" (3/3) ... [2024-10-12 18:45:33,158 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound2.c [2024-10-12 18:45:33,174 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:45:33,175 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:45:33,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:45:33,231 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;@5b4474a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:45:33,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:45:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-12 18:45:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 18:45:33,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:45:33,242 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:45:33,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:45:33,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:45:33,247 INFO L85 PathProgramCache]: Analyzing trace with hash -10312671, now seen corresponding path program 1 times [2024-10-12 18:45:33,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:45:33,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586254242] [2024-10-12 18:45:33,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:45:33,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:45:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:33,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:45:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:33,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:45:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:45:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:45:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586254242] [2024-10-12 18:45:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586254242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:45:33,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:45:33,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:45:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325438650] [2024-10-12 18:45:33,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:45:33,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:45:33,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:45:33,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:45:33,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:45:33,447 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:45:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:45:33,482 INFO L93 Difference]: Finished difference Result 58 states and 102 transitions. [2024-10-12 18:45:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:45:33,485 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-12 18:45:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:45:33,491 INFO L225 Difference]: With dead ends: 58 [2024-10-12 18:45:33,491 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 18:45:33,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-10-12 18:45:33,500 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:45:33,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:45:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 18:45:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 18:45:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-12 18:45:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2024-10-12 18:45:33,537 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 [2024-10-12 18:45:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:45:33,537 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-10-12 18:45:33,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:45:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2024-10-12 18:45:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:45:33,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:45:33,539 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:45:33,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:45:33,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:45:33,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:45:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash 763841584, now seen corresponding path program 1 times [2024-10-12 18:45:33,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:45:33,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965533800] [2024-10-12 18:45:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:45:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:45:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:34,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:45:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:45:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:45:34,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:45:34,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965533800] [2024-10-12 18:45:34,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965533800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:45:34,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:45:34,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:45:34,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508845369] [2024-10-12 18:45:34,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:45:34,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:45:34,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:45:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:45:34,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:45:34,083 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:45:38,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 18:45:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:45:38,338 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2024-10-12 18:45:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:45:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-12 18:45:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:45:38,340 INFO L225 Difference]: With dead ends: 60 [2024-10-12 18:45:38,340 INFO L226 Difference]: Without dead ends: 42 [2024-10-12 18:45:38,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:45:38,342 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:45:38,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 158 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 18:45:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-12 18:45:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-12 18:45:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-12 18:45:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-10-12 18:45:38,367 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2024-10-12 18:45:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:45:38,367 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-10-12 18:45:38,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:45:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-10-12 18:45:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 18:45:38,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:45:38,368 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:45:38,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:45:38,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:45:38,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:45:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash -82339253, now seen corresponding path program 1 times [2024-10-12 18:45:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:45:38,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731429736] [2024-10-12 18:45:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:45:38,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:45:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:38,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:45:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:45:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:45:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:45:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731429736] [2024-10-12 18:45:38,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731429736] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:45:38,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945501109] [2024-10-12 18:45:38,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:45:38,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:45:38,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:45:38,760 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-10-12 18:45:38,762 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-10-12 18:45:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:38,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 18:45:38,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:45:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:45:39,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:45:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:45:39,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945501109] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:45:39,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:45:39,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-10-12 18:45:39,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622595590] [2024-10-12 18:45:39,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:45:39,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 18:45:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:45:39,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 18:45:39,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-12 18:45:39,248 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:45:42,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 18:45:44,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 18:45:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:45:45,223 INFO L93 Difference]: Finished difference Result 133 states and 216 transitions. [2024-10-12 18:45:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:45:45,225 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-12 18:45:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:45:45,228 INFO L225 Difference]: With dead ends: 133 [2024-10-12 18:45:45,228 INFO L226 Difference]: Without dead ends: 115 [2024-10-12 18:45:45,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-10-12 18:45:45,230 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-12 18:45:45,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 267 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-12 18:45:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-12 18:45:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 67. [2024-10-12 18:45:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 40 states have internal predecessors, (47), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 18:45:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-10-12 18:45:45,266 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 21 [2024-10-12 18:45:45,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:45:45,269 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-10-12 18:45:45,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 18:45:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-10-12 18:45:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:45:45,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:45:45,270 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:45:45,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:45:45,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:45:45,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:45:45,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:45:45,479 INFO L85 PathProgramCache]: Analyzing trace with hash -93184560, now seen corresponding path program 1 times [2024-10-12 18:45:45,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:45:45,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281801330] [2024-10-12 18:45:45,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:45:45,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:45:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:45:45,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463827856] [2024-10-12 18:45:45,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:45:45,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:45:45,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:45:45,515 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-10-12 18:45:45,517 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-10-12 18:45:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:45,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:45:45,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:45:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 18:45:45,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:45:45,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:45:45,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281801330] [2024-10-12 18:45:45,607 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:45:45,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463827856] [2024-10-12 18:45:45,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463827856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:45:45,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:45:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:45:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828321474] [2024-10-12 18:45:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:45:45,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:45:45,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:45:45,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:45:45,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:45:45,612 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 18:45:49,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-12 18:45:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:45:49,793 INFO L93 Difference]: Finished difference Result 94 states and 135 transitions. [2024-10-12 18:45:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:45:49,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-10-12 18:45:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:45:49,796 INFO L225 Difference]: With dead ends: 94 [2024-10-12 18:45:49,796 INFO L226 Difference]: Without dead ends: 91 [2024-10-12 18:45:49,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:45:49,798 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:45:49,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 18:45:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-12 18:45:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-12 18:45:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 49 states have internal predecessors, (57), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-12 18:45:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-10-12 18:45:49,822 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 29 [2024-10-12 18:45:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:45:49,822 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-10-12 18:45:49,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 18:45:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-10-12 18:45:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:45:49,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:45:49,824 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:45:49,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:45:50,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-12 18:45:50,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:45:50,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:45:50,029 INFO L85 PathProgramCache]: Analyzing trace with hash 471953405, now seen corresponding path program 1 times [2024-10-12 18:45:50,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:45:50,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986246269] [2024-10-12 18:45:50,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:45:50,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:45:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:50,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:45:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:50,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 18:45:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:50,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 18:45:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:45:50,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:45:50,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986246269] [2024-10-12 18:45:50,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986246269] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:45:50,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260191398] [2024-10-12 18:45:50,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:45:50,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:45:50,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:45:50,206 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-10-12 18:45:50,207 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-10-12 18:45:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:45:50,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 18:45:50,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:45:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:45:50,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:45:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:45:50,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260191398] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:45:50,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:45:50,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-12 18:45:50,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683015701] [2024-10-12 18:45:50,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:45:50,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:45:50,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:45:50,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:45:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:45:50,444 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 18:45:51,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 18:45:55,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 18:45:59,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 18:46:03,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 18:46:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:46:04,711 INFO L93 Difference]: Finished difference Result 120 states and 167 transitions. [2024-10-12 18:46:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 18:46:04,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2024-10-12 18:46:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:46:04,713 INFO L225 Difference]: With dead ends: 120 [2024-10-12 18:46:04,713 INFO L226 Difference]: Without dead ends: 74 [2024-10-12 18:46:04,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-12 18:46:04,714 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 30 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 65 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:46:04,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 263 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 14.2s Time] [2024-10-12 18:46:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-12 18:46:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2024-10-12 18:46:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 18:46:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2024-10-12 18:46:04,740 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 28 [2024-10-12 18:46:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:46:04,740 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2024-10-12 18:46:04,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 18:46:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2024-10-12 18:46:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 18:46:04,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:46:04,743 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:46:04,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 18:46:04,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:46:04,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:46:04,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:46:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash -208842498, now seen corresponding path program 1 times [2024-10-12 18:46:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:46:04,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613962186] [2024-10-12 18:46:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:46:04,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:46:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 18:46:04,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914907862] [2024-10-12 18:46:04,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:46:04,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:46:04,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:46:04,975 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-10-12 18:46:04,980 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-10-12 18:46:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:46:05,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 18:46:05,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:46:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 18:46:05,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:46:17,509 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-12 18:46:39,172 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-12 18:46:59,376 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-12 18:47:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 18:47:13,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:47:13,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613962186] [2024-10-12 18:47:13,155 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-12 18:47:13,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914907862] [2024-10-12 18:47:13,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914907862] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:47:13,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:47:13,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-10-12 18:47:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075741665] [2024-10-12 18:47:13,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:47:13,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:47:13,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:47:13,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:47:13,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:47:13,156 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-12 18:47:14,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []