./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/hard-u_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/hard-u_valuebound20.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 83a507b5a78977c4a0b48a152de77bd7eabcfca9b19b757436d28082e86741ee --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:21:08,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:21:08,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:21:08,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:21:08,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:21:08,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:21:08,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:21:08,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:21:08,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:21:08,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:21:08,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:21:08,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:21:08,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:21:08,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:21:08,739 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:21:08,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:21:08,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:21:08,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:21:08,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:21:08,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:21:08,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:21:08,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:21:08,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:21:08,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:21:08,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:21:08,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:21:08,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:21:08,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:21:08,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:21:08,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:21:08,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:21:08,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:21:08,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:21:08,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:21:08,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:21:08,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:21:08,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:21:08,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:21:08,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:21:08,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:21:08,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:21:08,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:21:08,749 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 -> 83a507b5a78977c4a0b48a152de77bd7eabcfca9b19b757436d28082e86741ee [2024-10-24 00:21:09,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:21:09,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:21:09,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:21:09,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:21:09,044 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:21:09,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound20.c [2024-10-24 00:21:10,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:21:10,696 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:21:10,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound20.c [2024-10-24 00:21:10,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b05bff1e3/79690d06a5da491199c97ca3cd16d888/FLAG40b0007b6 [2024-10-24 00:21:10,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b05bff1e3/79690d06a5da491199c97ca3cd16d888 [2024-10-24 00:21:10,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:21:10,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:21:10,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:21:10,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:21:10,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:21:10,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:10,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c07a465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10, skipping insertion in model container [2024-10-24 00:21:10,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:10,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:21:10,919 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/hard-u_valuebound20.c[537,550] [2024-10-24 00:21:10,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:21:10,941 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:21:10,952 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/hard-u_valuebound20.c[537,550] [2024-10-24 00:21:10,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:21:10,976 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:21:10,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10 WrapperNode [2024-10-24 00:21:10,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:21:10,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:21:10,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:21:10,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:21:10,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:10,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:11,003 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-10-24 00:21:11,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:21:11,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:21:11,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:21:11,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:21:11,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:11,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:11,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:11,024 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-24 00:21:11,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:11,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:11,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:11,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:11,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:11,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:11,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:21:11,034 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:21:11,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:21:11,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:21:11,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (1/1) ... [2024-10-24 00:21:11,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:21:11,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:21:11,063 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-24 00:21:11,066 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-24 00:21:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:21:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 00:21:11,107 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 00:21:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:21:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:21:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:21:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 00:21:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 00:21:11,161 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:21:11,163 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:21:11,290 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-24 00:21:11,290 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:21:11,310 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:21:11,310 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 00:21:11,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:21:11 BoogieIcfgContainer [2024-10-24 00:21:11,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:21:11,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:21:11,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:21:11,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:21:11,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:21:10" (1/3) ... [2024-10-24 00:21:11,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e4bb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:21:11, skipping insertion in model container [2024-10-24 00:21:11,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:21:10" (2/3) ... [2024-10-24 00:21:11,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e4bb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:21:11, skipping insertion in model container [2024-10-24 00:21:11,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:21:11" (3/3) ... [2024-10-24 00:21:11,320 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound20.c [2024-10-24 00:21:11,334 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:21:11,335 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:21:11,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:21:11,399 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;@ed4c309, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:21:11,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:21:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 00:21:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 00:21:11,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:21:11,409 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:21:11,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:21:11,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:21:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times [2024-10-24 00:21:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:21:11,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295538772] [2024-10-24 00:21:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:21:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:21:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:11,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 00:21:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:11,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 00:21:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 00:21:11,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:21:11,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295538772] [2024-10-24 00:21:11,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295538772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:21:11,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:21:11,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 00:21:11,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000639502] [2024-10-24 00:21:11,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:21:11,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:21:11,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:21:11,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:21:11,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 00:21:11,600 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 00:21:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:21:11,639 INFO L93 Difference]: Finished difference Result 58 states and 99 transitions. [2024-10-24 00:21:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:21:11,642 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-10-24 00:21:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:21:11,648 INFO L225 Difference]: With dead ends: 58 [2024-10-24 00:21:11,648 INFO L226 Difference]: Without dead ends: 28 [2024-10-24 00:21:11,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-24 00:21:11,655 INFO L432 NwaCegarLoop]: 38 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, 38 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-24 00:21:11,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:21:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-24 00:21:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-24 00:21:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 00:21:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-24 00:21:11,690 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23 [2024-10-24 00:21:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:21:11,690 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-24 00:21:11,690 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 00:21:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-24 00:21:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 00:21:11,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:21:11,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:21:11,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 00:21:11,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:21:11,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:21:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times [2024-10-24 00:21:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:21:11,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004287178] [2024-10-24 00:21:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:21:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:11,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:21:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:11,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 00:21:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:11,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 00:21:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 00:21:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:21:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004287178] [2024-10-24 00:21:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004287178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:21:11,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:21:11,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:21:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81307363] [2024-10-24 00:21:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:21:11,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:21:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:21:11,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:21:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:21:11,993 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 00:21:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:21:12,065 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-10-24 00:21:12,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:21:12,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-10-24 00:21:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:21:12,067 INFO L225 Difference]: With dead ends: 41 [2024-10-24 00:21:12,067 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 00:21:12,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-24 00:21:12,070 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:21:12,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 119 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:21:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 00:21:12,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2024-10-24 00:21:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 00:21:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-10-24 00:21:12,089 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2024-10-24 00:21:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:21:12,089 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-10-24 00:21:12,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 00:21:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-10-24 00:21:12,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 00:21:12,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:21:12,090 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:21:12,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 00:21:12,091 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:21:12,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:21:12,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times [2024-10-24 00:21:12,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:21:12,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460653103] [2024-10-24 00:21:12,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:12,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:21:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:12,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:21:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 00:21:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:12,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 00:21:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 00:21:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 00:21:12,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:21:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460653103] [2024-10-24 00:21:12,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460653103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:21:12,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:21:12,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:21:12,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065616775] [2024-10-24 00:21:12,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:21:12,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:21:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:21:12,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:21:12,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:21:12,486 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-24 00:21:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:21:12,609 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-10-24 00:21:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:21:12,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 28 [2024-10-24 00:21:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:21:12,610 INFO L225 Difference]: With dead ends: 45 [2024-10-24 00:21:12,611 INFO L226 Difference]: Without dead ends: 43 [2024-10-24 00:21:12,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-24 00:21:12,612 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:21:12,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:21:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-24 00:21:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-10-24 00:21:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 00:21:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-24 00:21:12,628 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2024-10-24 00:21:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:21:12,629 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-24 00:21:12,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-24 00:21:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-10-24 00:21:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 00:21:12,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:21:12,630 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:21:12,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 00:21:12,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:21:12,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:21:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times [2024-10-24 00:21:12,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:21:12,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818929873] [2024-10-24 00:21:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:12,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:21:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:21:12,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516674264] [2024-10-24 00:21:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:12,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:21:12,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:21:12,667 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-24 00:21:12,668 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-24 00:21:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:12,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 00:21:12,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:21:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 00:21:12,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:21:12,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:21:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818929873] [2024-10-24 00:21:12,947 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:21:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516674264] [2024-10-24 00:21:12,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516674264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:21:12,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:21:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:21:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562276849] [2024-10-24 00:21:12,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:21:12,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:21:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:21:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:21:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:21:12,952 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 00:21:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:21:13,239 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-10-24 00:21:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:21:13,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2024-10-24 00:21:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:21:13,242 INFO L225 Difference]: With dead ends: 62 [2024-10-24 00:21:13,244 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 00:21:13,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:21:13,245 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 27 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:21:13,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 00:21:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 00:21:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-24 00:21:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 00:21:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-10-24 00:21:13,263 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 33 [2024-10-24 00:21:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:21:13,264 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-10-24 00:21:13,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 00:21:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-10-24 00:21:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 00:21:13,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:21:13,265 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:21:13,282 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-24 00:21:13,465 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-10-24 00:21:13,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:21:13,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:21:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times [2024-10-24 00:21:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:21:13,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128967368] [2024-10-24 00:21:13,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:13,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:21:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:21:13,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [787792796] [2024-10-24 00:21:13,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:13,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:21:13,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:21:13,510 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-24 00:21:13,511 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-24 00:21:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:13,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 00:21:13,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:21:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 00:21:13,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:21:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:21:14,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:21:14,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128967368] [2024-10-24 00:21:14,683 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:21:14,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787792796] [2024-10-24 00:21:14,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787792796] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:21:14,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 00:21:14,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-10-24 00:21:14,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465693410] [2024-10-24 00:21:14,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 00:21:14,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 00:21:14,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:21:14,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 00:21:14,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:21:14,688 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-24 00:21:19,528 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-24 00:21:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:21:19,556 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-10-24 00:21:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 00:21:19,558 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 40 [2024-10-24 00:21:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:21:19,561 INFO L225 Difference]: With dead ends: 67 [2024-10-24 00:21:19,562 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 00:21:19,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-10-24 00:21:19,567 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:21:19,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 157 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 198 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-10-24 00:21:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 00:21:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-24 00:21:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 00:21:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2024-10-24 00:21:19,589 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 40 [2024-10-24 00:21:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:21:19,591 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2024-10-24 00:21:19,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-24 00:21:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-10-24 00:21:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 00:21:19,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:21:19,595 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:21:19,612 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-24 00:21:19,799 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-10-24 00:21:19,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:21:19,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:21:19,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1147651331, now seen corresponding path program 1 times [2024-10-24 00:21:19,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:21:19,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520224267] [2024-10-24 00:21:19,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:19,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:21:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:21:19,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780166384] [2024-10-24 00:21:19,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:19,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:21:19,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:21:19,847 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-24 00:21:19,849 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-24 00:21:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:19,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 00:21:19,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:21:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 00:21:20,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:21:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 00:21:20,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:21:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520224267] [2024-10-24 00:21:20,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:21:20,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780166384] [2024-10-24 00:21:20,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780166384] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 00:21:20,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:21:20,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-10-24 00:21:20,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771249630] [2024-10-24 00:21:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:21:20,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:21:20,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:21:20,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:21:20,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:21:20,304 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 00:21:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:21:21,317 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-10-24 00:21:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:21:21,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2024-10-24 00:21:21,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:21:21,318 INFO L225 Difference]: With dead ends: 69 [2024-10-24 00:21:21,318 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 00:21:21,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:21:21,320 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:21:21,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 136 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:21:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 00:21:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-24 00:21:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.1) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 00:21:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2024-10-24 00:21:21,347 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 50 [2024-10-24 00:21:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:21:21,347 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2024-10-24 00:21:21,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 00:21:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2024-10-24 00:21:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 00:21:21,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:21:21,349 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:21:21,358 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-10-24 00:21:21,549 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-10-24 00:21:21,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:21:21,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:21:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash 961839043, now seen corresponding path program 1 times [2024-10-24 00:21:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:21:21,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622481919] [2024-10-24 00:21:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:21,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:21:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:21:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 00:21:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 00:21:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 00:21:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 00:21:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:21:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:21:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 00:21:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 00:21:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:21:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:21:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 00:21:21,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:21:21,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622481919] [2024-10-24 00:21:21,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622481919] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:21:21,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284150959] [2024-10-24 00:21:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:21,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:21:21,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:21:21,720 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-24 00:21:21,722 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-24 00:21:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:21,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 00:21:21,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:21:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-24 00:21:21,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:21:21,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284150959] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:21:21,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 00:21:21,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2024-10-24 00:21:21,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592579246] [2024-10-24 00:21:21,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 00:21:21,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:21:21,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:21:22,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:21:22,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:21:22,003 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-24 00:21:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:21:22,398 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2024-10-24 00:21:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:21:22,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 68 [2024-10-24 00:21:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:21:22,400 INFO L225 Difference]: With dead ends: 98 [2024-10-24 00:21:22,400 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 00:21:22,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:21:22,401 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:21:22,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 177 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 00:21:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 00:21:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-10-24 00:21:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 00:21:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2024-10-24 00:21:22,424 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 68 [2024-10-24 00:21:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:21:22,425 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2024-10-24 00:21:22,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-24 00:21:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2024-10-24 00:21:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 00:21:22,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:21:22,428 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:21:22,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:21:22,631 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-10-24 00:21:22,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:21:22,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:21:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times [2024-10-24 00:21:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:21:22,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81195583] [2024-10-24 00:21:22,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:22,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:21:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:21:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058055274] [2024-10-24 00:21:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:21:22,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:21:22,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:21:22,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-10-24 00:21:22,669 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-10-24 00:21:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:21:23,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-24 00:21:23,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:21:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 43 proven. 31 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-24 00:21:24,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:21:49,216 WARN L286 SmtUtils]: Spent 7.48s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 00:22:02,398 WARN L286 SmtUtils]: Spent 12.20s 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-24 00:22:06,759 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_ULTIMATE.start_main_~d~0#1| 2147483648)) (.cse2 (* |c_ULTIMATE.start_main_~B~0#1| |c_ULTIMATE.start_main_~q~0#1|)) (.cse0 (mod |c_ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse3 (mod |c_ULTIMATE.start_main_~d~0#1| 4294967296))) (or (= .cse0 (mod (+ (* (mod |c_ULTIMATE.start_main_~p~0#1| 2147483648) |c_ULTIMATE.start_main_~B~0#1|) (* 4294967295 .cse1) .cse2 |c_ULTIMATE.start_main_~A~0#1|) 4294967296)) (< (* 2 .cse1) (+ .cse0 1)) (not (= .cse3 (mod (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~B~0#1|) 4294967296))) (not (= .cse0 (mod (+ .cse2 |c_ULTIMATE.start_main_~A~0#1|) 4294967296))) (< .cse0 .cse3))) is different from true [2024-10-24 00:22:21,679 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 00:22:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 40 proven. 24 refuted. 0 times theorem prover too weak. 79 trivial. 4 not checked. [2024-10-24 00:22:44,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:22:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81195583] [2024-10-24 00:22:44,998 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:22:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058055274] [2024-10-24 00:22:44,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058055274] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:22:44,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 00:22:44,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2024-10-24 00:22:44,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599941592] [2024-10-24 00:22:44,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 00:22:44,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 00:22:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:22:45,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 00:22:45,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=449, Unknown=2, NotChecked=44, Total=600 [2024-10-24 00:22:45,001 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 19 states have internal predecessors, (38), 13 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 12 states have call predecessors, (22), 11 states have call successors, (22)