./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.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_unwindbound20.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 c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:37:35,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:37:35,770 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:35,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:37:35,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:37:35,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:37:35,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:37:35,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:37:35,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:37:35,802 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:37:35,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:37:35,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:37:35,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:37:35,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:37:35,804 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:37:35,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:37:35,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:37:35,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:37:35,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:37:35,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:37:35,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:37:35,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:37:35,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:37:35,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:37:35,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:37:35,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:37:35,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:37:35,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:37:35,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:37:35,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:37:35,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:37:35,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:37:35,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:37:35,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:37:35,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:37:35,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:37:35,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:37:35,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:37:35,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:37:35,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:37:35,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:37:35,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:37:35,814 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 -> c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a [2024-11-09 22:37:35,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:37:36,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:37:36,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:37:36,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:37:36,015 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:37:36,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2024-11-09 22:37:37,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:37:37,547 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:37:37,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2024-11-09 22:37:37,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5c2addf/80e14c3845094c1b9953d2c361d2f931/FLAGc68b0be44 [2024-11-09 22:37:37,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b5c2addf/80e14c3845094c1b9953d2c361d2f931 [2024-11-09 22:37:37,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:37:37,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:37:37,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:37:37,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:37:37,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:37:37,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:37" (1/1) ... [2024-11-09 22:37:37,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f751174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:37, skipping insertion in model container [2024-11-09 22:37:37,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:37" (1/1) ... [2024-11-09 22:37:37,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:37:37,754 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_unwindbound20.c[524,537] [2024-11-09 22:37:37,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:37:37,772 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:37:37,780 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_unwindbound20.c[524,537] [2024-11-09 22:37:37,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:37:37,796 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:37:37,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:37 WrapperNode [2024-11-09 22:37:37,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:37:37,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:37:37,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:37:37,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:37:37,804 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:37" (1/1) ... [2024-11-09 22:37:37,809 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:37" (1/1) ... [2024-11-09 22:37:37,819 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-11-09 22:37:37,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:37:37,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:37:37,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:37:37,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:37:37,827 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:37" (1/1) ... [2024-11-09 22:37:37,827 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:37" (1/1) ... [2024-11-09 22:37:37,828 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:37" (1/1) ... [2024-11-09 22:37:37,835 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:37,835 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:37" (1/1) ... [2024-11-09 22:37:37,835 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:37" (1/1) ... [2024-11-09 22:37:37,837 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:37" (1/1) ... [2024-11-09 22:37:37,837 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:37" (1/1) ... [2024-11-09 22:37:37,837 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:37" (1/1) ... [2024-11-09 22:37:37,838 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:37" (1/1) ... [2024-11-09 22:37:37,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:37:37,840 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:37:37,840 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:37:37,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:37:37,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:37" (1/1) ... [2024-11-09 22:37:37,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:37:37,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:37,863 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:37,866 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:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:37:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 22:37:37,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 22:37:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:37:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:37:37,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:37:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:37:37,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:37:37,943 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:37:37,944 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:37:38,029 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-09 22:37:38,029 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:37:38,037 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:37:38,037 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:37:38,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:38 BoogieIcfgContainer [2024-11-09 22:37:38,038 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:37:38,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:37:38,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:37:38,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:37:38,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:37:37" (1/3) ... [2024-11-09 22:37:38,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ee546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:38, skipping insertion in model container [2024-11-09 22:37:38,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:37" (2/3) ... [2024-11-09 22:37:38,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ee546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:38, skipping insertion in model container [2024-11-09 22:37:38,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:38" (3/3) ... [2024-11-09 22:37:38,043 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2024-11-09 22:37:38,055 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:37:38,055 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:37:38,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:37:38,103 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;@43d5bba2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:37:38,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:37:38,106 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:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:37:38,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:38,112 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:38,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:38,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:38,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1418380544, now seen corresponding path program 1 times [2024-11-09 22:37:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649558284] [2024-11-09 22:37:38,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:38,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:38,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:38,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:38,251 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:38,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:38,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649558284] [2024-11-09 22:37:38,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649558284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:38,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:38,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:37:38,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875036152] [2024-11-09 22:37:38,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:38,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:37:38,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:38,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:37:38,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:37:38,275 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:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:38,292 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-11-09 22:37:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:37:38,294 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:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:38,298 INFO L225 Difference]: With dead ends: 49 [2024-11-09 22:37:38,299 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 22:37:38,301 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:38,303 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:38,305 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:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 22:37:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 22:37:38,335 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:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-09 22:37:38,337 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 19 [2024-11-09 22:37:38,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:38,338 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-09 22:37:38,338 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:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-09 22:37:38,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:37:38,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:38,339 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:38,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:37:38,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:38,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1520797452, now seen corresponding path program 1 times [2024-11-09 22:37:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:38,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48171992] [2024-11-09 22:37:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:38,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:38,510 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:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:38,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48171992] [2024-11-09 22:37:38,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48171992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:38,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:38,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:37:38,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60038987] [2024-11-09 22:37:38,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:38,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:37:38,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:37:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:38,514 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:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:38,529 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-09 22:37:38,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:37:38,530 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:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:38,532 INFO L225 Difference]: With dead ends: 32 [2024-11-09 22:37:38,532 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 22:37:38,533 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:38,535 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:38,535 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:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 22:37:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 22:37:38,543 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:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-09 22:37:38,543 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 20 [2024-11-09 22:37:38,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:38,544 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-09 22:37:38,545 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:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-09 22:37:38,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:37:38,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:38,546 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:38,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:37:38,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:38,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:38,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1551273645, now seen corresponding path program 1 times [2024-11-09 22:37:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:38,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17009270] [2024-11-09 22:37:38,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:37:38,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341384843] [2024-11-09 22:37:38,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:38,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:38,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:38,573 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:38,575 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:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:38,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:37:38,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:38,923 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:38,923 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:37:38,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:38,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17009270] [2024-11-09 22:37:38,927 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:37:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341384843] [2024-11-09 22:37:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341384843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:37:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594475420] [2024-11-09 22:37:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:38,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:37:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:38,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:37:38,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:38,932 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:40,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 22:37:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:40,604 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2024-11-09 22:37:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:37:40,605 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:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:40,606 INFO L225 Difference]: With dead ends: 37 [2024-11-09 22:37:40,606 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 22:37:40,606 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:40,607 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:40,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 22:37:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 22:37:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-09 22:37:40,613 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:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-09 22:37:40,614 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2024-11-09 22:37:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:40,615 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-09 22:37:40,615 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:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-09 22:37:40,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:37:40,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:40,616 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:40,632 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:40,819 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:40,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:40,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1010582696, now seen corresponding path program 1 times [2024-11-09 22:37:40,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:40,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575531676] [2024-11-09 22:37:40,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:40,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:41,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:41,114 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:41,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:41,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575531676] [2024-11-09 22:37:41,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575531676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:41,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067180734] [2024-11-09 22:37:41,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:41,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:41,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:41,117 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:41,119 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:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:41,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 22:37:41,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:41,210 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:41,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:41,296 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:41,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067180734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:41,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:41,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-11-09 22:37:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231887101] [2024-11-09 22:37:41,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:41,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:37:41,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:41,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:37:41,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:37:41,298 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:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:41,392 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-09 22:37:41,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:37:41,392 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:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:41,393 INFO L225 Difference]: With dead ends: 41 [2024-11-09 22:37:41,393 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 22:37:41,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:37:41,394 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:41,395 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:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 22:37:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2024-11-09 22:37:41,400 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:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-09 22:37:41,401 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 26 [2024-11-09 22:37:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:41,401 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 22:37:41,401 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:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-09 22:37:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 22:37:41,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:41,402 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:41,416 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:41,603 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:41,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:41,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:41,604 INFO L85 PathProgramCache]: Analyzing trace with hash 282842253, now seen corresponding path program 1 times [2024-11-09 22:37:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:41,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143972972] [2024-11-09 22:37:41,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:41,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:41,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:41,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:41,666 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:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:41,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143972972] [2024-11-09 22:37:41,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143972972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:41,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112005657] [2024-11-09 22:37:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:41,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:41,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:41,668 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:41,670 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:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:41,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 22:37:41,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:41,738 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:41,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:41,776 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:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112005657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:41,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-11-09 22:37:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355607758] [2024-11-09 22:37:41,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:41,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:37:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:41,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:37:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:37:41,778 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:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:41,831 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-11-09 22:37:41,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:37:41,831 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:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:41,832 INFO L225 Difference]: With dead ends: 59 [2024-11-09 22:37:41,832 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 22:37:41,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:37:41,833 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:41,833 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.0s Time] [2024-11-09 22:37:41,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 22:37:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-09 22:37:41,842 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:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-09 22:37:41,843 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 29 [2024-11-09 22:37:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:41,843 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-09 22:37:41,843 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:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-09 22:37:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 22:37:41,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:41,844 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:41,861 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:42,048 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:42,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:42,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:42,049 INFO L85 PathProgramCache]: Analyzing trace with hash 788316492, now seen corresponding path program 2 times [2024-11-09 22:37:42,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:42,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355515459] [2024-11-09 22:37:42,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:42,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:37:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 22:37:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 22:37:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:42,236 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:42,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:42,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355515459] [2024-11-09 22:37:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355515459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:42,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029833976] [2024-11-09 22:37:42,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:37:42,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:42,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:42,238 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:42,239 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:42,285 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:37:42,286 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:37:42,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 22:37:42,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:42,346 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:42,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:42,446 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:42,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029833976] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:42,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:42,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-11-09 22:37:42,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815196473] [2024-11-09 22:37:42,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:42,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 22:37:42,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:42,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 22:37:42,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:37:42,448 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 22:37:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:42,591 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-11-09 22:37:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 22:37:42,591 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 56 [2024-11-09 22:37:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:42,592 INFO L225 Difference]: With dead ends: 113 [2024-11-09 22:37:42,593 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 22:37:42,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-11-09 22:37:42,593 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 80 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:42,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 142 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 22:37:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-09 22:37:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 22:37:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-09 22:37:42,625 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 56 [2024-11-09 22:37:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:42,625 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-09 22:37:42,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 22:37:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-09 22:37:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 22:37:42,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:42,627 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:42,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:42,828 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:42,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:42,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1983929516, now seen corresponding path program 3 times [2024-11-09 22:37:42,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:42,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829357361] [2024-11-09 22:37:42,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:42,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:37:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 22:37:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 22:37:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 22:37:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 22:37:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 22:37:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 22:37:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:37:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 22:37:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 22:37:43,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:43,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829357361] [2024-11-09 22:37:43,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829357361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:43,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699591653] [2024-11-09 22:37:43,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:37:43,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:43,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:43,148 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:43,149 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:43,301 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-09 22:37:43,301 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:37:43,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 22:37:43,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:43,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 22:37:43,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699591653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:43,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:43,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 26 [2024-11-09 22:37:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053630430] [2024-11-09 22:37:43,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:43,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 22:37:43,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:43,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 22:37:43,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2024-11-09 22:37:43,670 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) [2024-11-09 22:37:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:44,022 INFO L93 Difference]: Finished difference Result 203 states and 233 transitions. [2024-11-09 22:37:44,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-09 22:37:44,022 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) Word has length 110 [2024-11-09 22:37:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:44,024 INFO L225 Difference]: With dead ends: 203 [2024-11-09 22:37:44,024 INFO L226 Difference]: Without dead ends: 197 [2024-11-09 22:37:44,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=687, Invalid=1205, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 22:37:44,025 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 116 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:44,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 200 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-09 22:37:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-09 22:37:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 22:37:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2024-11-09 22:37:44,051 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 110 [2024-11-09 22:37:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:44,051 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2024-11-09 22:37:44,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) [2024-11-09 22:37:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2024-11-09 22:37:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-09 22:37:44,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:44,053 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:44,060 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:44,254 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:44,255 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:44,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1404594764, now seen corresponding path program 4 times [2024-11-09 22:37:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:44,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556515157] [2024-11-09 22:37:44,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:37:44,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571333758] [2024-11-09 22:37:44,320 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 22:37:44,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:44,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:44,322 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:44,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:37:44,408 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 22:37:44,408 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 22:37:44,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:37:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:37:44,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:37:44,496 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:37:44,497 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:37:44,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 22:37:44,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:44,701 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-11-09 22:37:44,757 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:37:44,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:37:44 BoogieIcfgContainer [2024-11-09 22:37:44,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:37:44,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:37:44,760 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:37:44,760 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:37:44,760 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:38" (3/4) ... [2024-11-09 22:37:44,760 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:37:44,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:37:44,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:37:44,844 INFO L158 Benchmark]: Toolchain (without parser) took 7261.53ms. Allocated memory was 151.0MB in the beginning and 237.0MB in the end (delta: 86.0MB). Free memory was 123.1MB in the beginning and 114.2MB in the end (delta: 8.9MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2024-11-09 22:37:44,844 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:37:44,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.35ms. Allocated memory is still 151.0MB. Free memory was 122.9MB in the beginning and 113.8MB in the end (delta: 9.1MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-11-09 22:37:44,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.21ms. Allocated memory is still 151.0MB. Free memory was 112.9MB in the beginning and 111.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:37:44,845 INFO L158 Benchmark]: Boogie Preprocessor took 19.01ms. Allocated memory is still 151.0MB. Free memory was 111.7MB in the beginning and 110.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:37:44,845 INFO L158 Benchmark]: IcfgBuilder took 198.17ms. Allocated memory is still 151.0MB. Free memory was 110.5MB in the beginning and 98.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:37:44,845 INFO L158 Benchmark]: TraceAbstraction took 6720.19ms. Allocated memory was 151.0MB in the beginning and 237.0MB in the end (delta: 86.0MB). Free memory was 98.0MB in the beginning and 121.6MB in the end (delta: -23.7MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2024-11-09 22:37:44,845 INFO L158 Benchmark]: Witness Printer took 84.36ms. Allocated memory is still 237.0MB. Free memory was 121.6MB in the beginning and 114.2MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 22:37:44,846 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.16ms. Allocated memory is still 151.0MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.35ms. Allocated memory is still 151.0MB. Free memory was 122.9MB in the beginning and 113.8MB in the end (delta: 9.1MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.21ms. Allocated memory is still 151.0MB. Free memory was 112.9MB in the beginning and 111.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.01ms. Allocated memory is still 151.0MB. Free memory was 111.7MB in the beginning and 110.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 198.17ms. Allocated memory is still 151.0MB. Free memory was 110.5MB in the beginning and 98.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6720.19ms. Allocated memory was 151.0MB in the beginning and 237.0MB in the end (delta: 86.0MB). Free memory was 98.0MB in the beginning and 121.6MB in the end (delta: -23.7MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. * Witness Printer took 84.36ms. Allocated memory is still 237.0MB. Free memory was 121.6MB in the beginning and 114.2MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. 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=40403, R=202, 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=40403, R=202, counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=40403, counter=0, r=401, u=405, v=1] [L34] EXPR counter++ VAL [A=40403, counter=1, r=401, u=405, v=1] [L34] COND TRUE counter++<20 [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=40403, counter=1, r=401, u=405, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=1, r=401, u=405, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=1, r=400, u=405, v=3] [L34] EXPR counter++ VAL [A=40403, counter=2, r=400, u=405, v=3] [L34] COND TRUE counter++<20 [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=40403, counter=2, r=400, u=405, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=2, r=400, u=405, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=2, r=397, u=405, v=5] [L34] EXPR counter++ VAL [A=40403, counter=3, r=397, u=405, v=5] [L34] COND TRUE counter++<20 [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=40403, counter=3, r=397, u=405, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=3, r=397, u=405, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=3, r=392, u=405, v=7] [L34] EXPR counter++ VAL [A=40403, counter=4, r=392, u=405, v=7] [L34] COND TRUE counter++<20 [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=40403, counter=4, r=392, u=405, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=4, r=392, u=405, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=4, r=385, u=405, v=9] [L34] EXPR counter++ VAL [A=40403, counter=5, r=385, u=405, v=9] [L34] COND TRUE counter++<20 [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=40403, counter=5, r=385, u=405, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=5, r=385, u=405, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=5, r=376, u=405, v=11] [L34] EXPR counter++ VAL [A=40403, counter=6, r=376, u=405, v=11] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=6, r=376, u=405, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=6, r=376, u=405, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=6, r=365, u=405, v=13] [L34] EXPR counter++ VAL [A=40403, counter=7, r=365, u=405, v=13] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=7, r=365, u=405, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=7, r=365, u=405, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=7, r=352, u=405, v=15] [L34] EXPR counter++ VAL [A=40403, counter=8, r=352, u=405, v=15] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=8, r=352, u=405, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=8, r=352, u=405, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=8, r=337, u=405, v=17] [L34] EXPR counter++ VAL [A=40403, counter=9, r=337, u=405, v=17] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=9, r=337, u=405, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=9, r=337, u=405, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=9, r=320, u=405, v=19] [L34] EXPR counter++ VAL [A=40403, counter=10, r=320, u=405, v=19] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=10, r=320, u=405, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=10, r=320, u=405, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=10, r=301, u=405, v=21] [L34] EXPR counter++ VAL [A=40403, counter=11, r=301, u=405, v=21] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=11, r=301, u=405, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=11, r=301, u=405, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=11, r=280, u=405, v=23] [L34] EXPR counter++ VAL [A=40403, counter=12, r=280, u=405, v=23] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=12, r=280, u=405, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=12, r=280, u=405, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=12, r=257, u=405, v=25] [L34] EXPR counter++ VAL [A=40403, counter=13, r=257, u=405, v=25] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=13, r=257, u=405, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=13, r=257, u=405, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=13, r=232, u=405, v=27] [L34] EXPR counter++ VAL [A=40403, counter=14, r=232, u=405, v=27] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=14, r=232, u=405, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=14, r=232, u=405, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=14, r=205, u=405, v=29] [L34] EXPR counter++ VAL [A=40403, counter=15, r=205, u=405, v=29] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=15, r=205, u=405, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=15, r=205, u=405, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=15, r=176, u=405, v=31] [L34] EXPR counter++ VAL [A=40403, counter=16, r=176, u=405, v=31] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=16, r=176, u=405, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=16, r=176, u=405, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=16, r=145, u=405, v=33] [L34] EXPR counter++ VAL [A=40403, counter=17, r=145, u=405, v=33] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=17, r=145, u=405, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=17, r=145, u=405, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=17, r=112, u=405, v=35] [L34] EXPR counter++ VAL [A=40403, counter=18, r=112, u=405, v=35] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=18, r=112, u=405, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=18, r=112, u=405, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=18, r=77, u=405, v=37] [L34] EXPR counter++ VAL [A=40403, counter=19, r=77, u=405, v=37] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=19, r=77, u=405, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=19, r=77, u=405, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=19, r=40, u=405, v=39] [L34] EXPR counter++ VAL [A=40403, counter=20, r=40, u=405, v=39] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=20, r=40, u=405, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=20, r=40, u=405, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=20, r=1, u=405, v=41] [L34] EXPR counter++ VAL [A=40403, counter=21, r=1, u=405, v=41] [L34] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 731 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 568 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 278 IncrementalHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 163 mSDtfsCounter, 278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 486 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=7, InterpolantAutomatonStates: 93, 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, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 921 NumberOfCodeBlocks, 921 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 1768 SizeOfPredicates, 17 NumberOfNonLiveVariables, 641 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 561/1623 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:44,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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