./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound5.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 a8eb1c4cff73de825c0246f8cf2782e4a89e8227445b840b0a85ffef021d29c3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:37:37,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:37:37,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:37:37,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:37:37,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:37:37,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:37:37,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:37:37,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:37:37,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:37:37,306 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:37:37,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:37:37,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:37:37,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:37:37,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:37:37,309 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:37:37,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:37:37,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:37:37,310 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:37:37,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:37:37,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:37:37,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:37:37,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:37:37,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:37:37,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:37:37,316 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:37:37,316 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:37:37,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:37:37,317 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:37:37,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:37:37,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:37:37,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:37:37,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:37:37,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:37:37,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:37:37,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:37:37,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:37:37,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:37:37,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:37:37,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:37:37,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:37:37,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:37:37,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:37:37,322 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 -> a8eb1c4cff73de825c0246f8cf2782e4a89e8227445b840b0a85ffef021d29c3 [2024-11-09 22:37:37,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:37:37,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:37:37,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:37:37,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:37:37,612 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:37:37,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2024-11-09 22:37:38,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:37:39,167 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:37:39,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2024-11-09 22:37:39,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60048cbcb/c346dfccef06413d970f4a35f8b51a20/FLAG47c7398ee [2024-11-09 22:37:39,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60048cbcb/c346dfccef06413d970f4a35f8b51a20 [2024-11-09 22:37:39,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:37:39,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:37:39,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:37:39,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:37:39,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:37:39,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53743dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39, skipping insertion in model container [2024-11-09 22:37:39,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:37:39,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound5.c[524,537] [2024-11-09 22:37:39,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:37:39,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:37:39,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound5.c[524,537] [2024-11-09 22:37:39,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:37:39,525 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:37:39,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39 WrapperNode [2024-11-09 22:37:39,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:37:39,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:37:39,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:37:39,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:37:39,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,564 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-11-09 22:37:39,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:37:39,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:37:39,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:37:39,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:37:39,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,596 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 22:37:39,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:37:39,612 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:37:39,613 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:37:39,613 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:37:39,614 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (1/1) ... [2024-11-09 22:37:39,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:37:39,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:39,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:37:39,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:37:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:37:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 22:37:39,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 22:37:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:37:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:37:39,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:37:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:37:39,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:37:39,758 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:37:39,762 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:37:39,921 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-09 22:37:39,922 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:37:39,939 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:37:39,940 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:37:39,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:39 BoogieIcfgContainer [2024-11-09 22:37:39,941 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:37:39,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:37:39,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:37:39,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:37:39,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:37:39" (1/3) ... [2024-11-09 22:37:39,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4609311c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:39, skipping insertion in model container [2024-11-09 22:37:39,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39" (2/3) ... [2024-11-09 22:37:39,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4609311c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:39, skipping insertion in model container [2024-11-09 22:37:39,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:39" (3/3) ... [2024-11-09 22:37:39,953 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound5.c [2024-11-09 22:37:39,970 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:37:39,970 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:37:40,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:37:40,037 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;@4bd39db9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:37:40,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:37:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 22:37:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:37:40,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:40,052 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:40,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:40,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1418380544, now seen corresponding path program 1 times [2024-11-09 22:37:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:40,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051476411] [2024-11-09 22:37:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:40,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:40,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:40,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:40,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051476411] [2024-11-09 22:37:40,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051476411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:40,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:40,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:37:40,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556265253] [2024-11-09 22:37:40,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:40,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:37:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:40,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:37:40,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:37:40,361 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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), 2 states have call successors, (2) [2024-11-09 22:37:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:40,382 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-11-09 22:37:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:37:40,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 19 [2024-11-09 22:37:40,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:40,392 INFO L225 Difference]: With dead ends: 49 [2024-11-09 22:37:40,392 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 22:37:40,396 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-11-09 22:37:40,400 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:40,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 22:37:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 22:37:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:37:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-09 22:37:40,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 19 [2024-11-09 22:37:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:40,446 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-09 22:37:40,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-11-09 22:37:40,447 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-09 22:37:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:37:40,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:40,450 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:40,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:37:40,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:40,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1520797452, now seen corresponding path program 1 times [2024-11-09 22:37:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:40,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648231163] [2024-11-09 22:37:40,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:40,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:40,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:40,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:40,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648231163] [2024-11-09 22:37:40,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648231163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:40,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:40,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:37:40,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443804953] [2024-11-09 22:37:40,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:40,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:37:40,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:37:40,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:40,677 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-09 22:37:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:40,697 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-09 22:37:40,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:37:40,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 20 [2024-11-09 22:37:40,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:40,698 INFO L225 Difference]: With dead ends: 32 [2024-11-09 22:37:40,699 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 22:37:40,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:40,700 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:40,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 22:37:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 22:37:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:37:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-09 22:37:40,711 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 20 [2024-11-09 22:37:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:40,713 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-09 22:37:40,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-09 22:37:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-09 22:37:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:37:40,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:40,714 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:40,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:37:40,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:40,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:40,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1551273645, now seen corresponding path program 1 times [2024-11-09 22:37:40,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:40,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624757110] [2024-11-09 22:37:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:40,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:37:40,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448524554] [2024-11-09 22:37:40,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:40,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:40,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:40,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:40,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:37:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:40,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:37:40,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:41,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:37:41,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624757110] [2024-11-09 22:37:41,115 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:37:41,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448524554] [2024-11-09 22:37:41,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448524554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:41,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:41,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:37:41,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197789599] [2024-11-09 22:37:41,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:41,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:37:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:41,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:37:41,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:41,120 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-11-09 22:37:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:41,809 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2024-11-09 22:37:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:37:41,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 20 [2024-11-09 22:37:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:41,811 INFO L225 Difference]: With dead ends: 37 [2024-11-09 22:37:41,811 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 22:37:41,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-11-09 22:37:41,813 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:41,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 22:37:41,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 22:37:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-09 22:37:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 22:37:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-09 22:37:41,824 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2024-11-09 22:37:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:41,824 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-09 22:37:41,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-11-09 22:37:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-09 22:37:41,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:37:41,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:41,826 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:41,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:42,027 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-11-09 22:37:42,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:42,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1010582696, now seen corresponding path program 1 times [2024-11-09 22:37:42,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:42,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344166856] [2024-11-09 22:37:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:42,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344166856] [2024-11-09 22:37:42,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344166856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996930781] [2024-11-09 22:37:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:42,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:42,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:42,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:42,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:37:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 22:37:42,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:42,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996930781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:42,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:42,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-11-09 22:37:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816117257] [2024-11-09 22:37:42,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:42,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:37:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:37:42,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:37:42,709 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 22:37:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:42,851 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-09 22:37:42,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:37:42,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 26 [2024-11-09 22:37:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:42,854 INFO L225 Difference]: With dead ends: 41 [2024-11-09 22:37:42,854 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 22:37:42,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:37:42,856 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:42,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 22:37:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2024-11-09 22:37:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:37:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-09 22:37:42,873 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 26 [2024-11-09 22:37:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:42,873 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 22:37:42,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 22:37:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-09 22:37:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 22:37:42,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:42,874 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:42,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 22:37:43,075 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-11-09 22:37:43,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:43,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash 282842253, now seen corresponding path program 1 times [2024-11-09 22:37:43,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:43,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448693269] [2024-11-09 22:37:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448693269] [2024-11-09 22:37:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448693269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504247248] [2024-11-09 22:37:43,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:43,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:43,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:43,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:37:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 22:37:43,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:43,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:43,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504247248] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:43,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:43,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-11-09 22:37:43,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612683862] [2024-11-09 22:37:43,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:43,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:37:43,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:43,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:37:43,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:37:43,457 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-09 22:37:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:43,545 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-11-09 22:37:43,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:37:43,546 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 29 [2024-11-09 22:37:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:43,547 INFO L225 Difference]: With dead ends: 59 [2024-11-09 22:37:43,547 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 22:37:43,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:37:43,550 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:43,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 85 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 22:37:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-09 22:37:43,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:37:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-09 22:37:43,569 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 29 [2024-11-09 22:37:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:43,570 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-09 22:37:43,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-09 22:37:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-09 22:37:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 22:37:43,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:43,573 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:43,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:43,777 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-11-09 22:37:43,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:43,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash 788316492, now seen corresponding path program 2 times [2024-11-09 22:37:43,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:43,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381911650] [2024-11-09 22:37:43,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:43,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:37:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 22:37:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 22:37:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 22:37:43,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:43,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381911650] [2024-11-09 22:37:43,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381911650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:43,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186897112] [2024-11-09 22:37:43,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:37:43,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:43,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:43,976 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:43,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:37:44,032 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:37:44,033 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:37:44,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 22:37:44,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:44,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 22:37:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186897112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:44,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:44,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 10 [2024-11-09 22:37:44,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743860524] [2024-11-09 22:37:44,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:44,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:37:44,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:44,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:37:44,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:37:44,245 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-09 22:37:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:44,334 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-11-09 22:37:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 22:37:44,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 56 [2024-11-09 22:37:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:44,336 INFO L225 Difference]: With dead ends: 68 [2024-11-09 22:37:44,336 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 22:37:44,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 116 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:37:44,337 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:44,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 22:37:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 22:37:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 22:37:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-09 22:37:44,353 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 56 [2024-11-09 22:37:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:44,355 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-09 22:37:44,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-09 22:37:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-09 22:37:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 22:37:44,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:44,357 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:44,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 22:37:44,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:44,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:44,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:44,562 INFO L85 PathProgramCache]: Analyzing trace with hash -463330739, now seen corresponding path program 3 times [2024-11-09 22:37:44,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:44,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737243889] [2024-11-09 22:37:44,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:44,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:37:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [532694541] [2024-11-09 22:37:44,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:37:44,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:44,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:44,609 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:44,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 22:37:44,733 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 22:37:44,733 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 22:37:44,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:37:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:37:44,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:37:44,827 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:37:44,828 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:37:44,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 22:37:45,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:45,033 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-09 22:37:45,067 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:37:45,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:37:45 BoogieIcfgContainer [2024-11-09 22:37:45,070 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:37:45,072 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:37:45,072 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:37:45,073 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:37:45,073 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:39" (3/4) ... [2024-11-09 22:37:45,074 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:37:45,134 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:37:45,135 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:37:45,135 INFO L158 Benchmark]: Toolchain (without parser) took 5926.34ms. Allocated memory was 163.6MB in the beginning and 241.2MB in the end (delta: 77.6MB). Free memory was 106.9MB in the beginning and 99.4MB in the end (delta: 7.5MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2024-11-09 22:37:45,135 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 163.6MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:37:45,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.69ms. Allocated memory is still 163.6MB. Free memory was 106.4MB in the beginning and 93.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:37:45,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.54ms. Allocated memory is still 163.6MB. Free memory was 93.8MB in the beginning and 92.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:37:45,136 INFO L158 Benchmark]: Boogie Preprocessor took 45.23ms. Allocated memory is still 163.6MB. Free memory was 92.5MB in the beginning and 90.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:37:45,136 INFO L158 Benchmark]: IcfgBuilder took 328.67ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 79.2MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 22:37:45,137 INFO L158 Benchmark]: TraceAbstraction took 5128.67ms. Allocated memory was 163.6MB in the beginning and 241.2MB in the end (delta: 77.6MB). Free memory was 78.7MB in the beginning and 102.5MB in the end (delta: -23.8MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2024-11-09 22:37:45,137 INFO L158 Benchmark]: Witness Printer took 62.30ms. Allocated memory is still 241.2MB. Free memory was 102.5MB in the beginning and 99.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 22:37:45,142 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 163.6MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.69ms. Allocated memory is still 163.6MB. Free memory was 106.4MB in the beginning and 93.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.54ms. Allocated memory is still 163.6MB. Free memory was 93.8MB in the beginning and 92.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.23ms. Allocated memory is still 163.6MB. Free memory was 92.5MB in the beginning and 90.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 328.67ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 79.2MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5128.67ms. Allocated memory was 163.6MB in the beginning and 241.2MB in the end (delta: 77.6MB). Free memory was 78.7MB in the beginning and 102.5MB in the end (delta: -23.8MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * Witness Printer took 62.30ms. Allocated memory is still 241.2MB. Free memory was 102.5MB in the beginning and 99.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=197, R=15, counter=0] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=197, R=15, counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=197, counter=0, r=28, u=31, v=1] [L34] EXPR counter++ VAL [A=197, counter=1, r=28, u=31, v=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=197, counter=1, r=28, u=31, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=197, counter=1, r=28, u=31, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=197, counter=1, r=27, u=31, v=3] [L34] EXPR counter++ VAL [A=197, counter=2, r=27, u=31, v=3] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=197, counter=2, r=27, u=31, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=197, counter=2, r=27, u=31, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=197, counter=2, r=24, u=31, v=5] [L34] EXPR counter++ VAL [A=197, counter=3, r=24, u=31, v=5] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=197, counter=3, r=24, u=31, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=197, counter=3, r=24, u=31, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=197, counter=3, r=19, u=31, v=7] [L34] EXPR counter++ VAL [A=197, counter=4, r=19, u=31, v=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=197, counter=4, r=19, u=31, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=197, counter=4, r=19, u=31, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=197, counter=4, r=12, u=31, v=9] [L34] EXPR counter++ VAL [A=197, counter=5, r=12, u=31, v=9] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=197, counter=5, r=12, u=31, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=197, counter=5, r=12, u=31, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=197, counter=5, r=3, u=31, v=11] [L34] EXPR counter++ VAL [A=197, counter=6, r=3, u=31, v=11] [L34] COND FALSE !(counter++<5) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=6] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L14] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 485 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 345 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 140 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 256 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 1005 SizeOfPredicates, 7 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 129/276 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 22:37:45,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE