./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:21:19,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:21:19,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:21:19,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:21:19,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:21:19,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:21:19,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:21:19,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:21:19,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:21:19,177 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:21:19,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:21:19,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:21:19,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:21:19,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:21:19,182 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:21:19,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:21:19,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:21:19,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:21:19,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:21:19,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:21:19,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:21:19,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:21:19,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:21:19,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:21:19,185 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:21:19,185 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:21:19,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:21:19,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:21:19,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:21:19,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:21:19,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:21:19,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:21:19,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:21:19,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:21:19,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:21:19,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:21:19,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:21:19,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:21:19,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:21:19,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:21:19,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:21:19,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:21:19,191 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2024-10-14 03:21:19,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:21:19,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:21:19,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:21:19,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:21:19,488 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:21:19,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-10-14 03:21:20,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:21:21,138 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:21:21,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-10-14 03:21:21,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d72c03eb/f0d3d2e814054a3e8cc6dd0d76256c0a/FLAG58ab8849d [2024-10-14 03:21:21,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d72c03eb/f0d3d2e814054a3e8cc6dd0d76256c0a [2024-10-14 03:21:21,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:21:21,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:21:21,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:21:21,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:21:21,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:21:21,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668d5254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21, skipping insertion in model container [2024-10-14 03:21:21,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:21:21,699 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-10-14 03:21:21,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:21:21,750 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:21:21,763 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-10-14 03:21:21,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:21:21,797 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:21:21,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21 WrapperNode [2024-10-14 03:21:21,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:21:21,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:21:21,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:21:21,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:21:21,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,831 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2024-10-14 03:21:21,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:21:21,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:21:21,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:21:21,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:21:21,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,860 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-14 03:21:21,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,867 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:21:21,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:21:21,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:21:21,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:21:21,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (1/1) ... [2024-10-14 03:21:21,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:21:21,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:21:21,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:21:21,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:21:21,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:21:21,959 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 03:21:21,960 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 03:21:21,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:21:21,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 03:21:21,960 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-10-14 03:21:21,960 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-10-14 03:21:21,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 03:21:21,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:21:21,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:21:21,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 03:21:21,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 03:21:21,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 03:21:21,961 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 03:21:21,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 03:21:22,042 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:21:22,044 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:21:22,207 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 03:21:22,208 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:21:22,260 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:21:22,263 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:21:22,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:21:22 BoogieIcfgContainer [2024-10-14 03:21:22,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:21:22,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:21:22,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:21:22,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:21:22,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:21:21" (1/3) ... [2024-10-14 03:21:22,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f67a85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:21:22, skipping insertion in model container [2024-10-14 03:21:22,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:21" (2/3) ... [2024-10-14 03:21:22,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f67a85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:21:22, skipping insertion in model container [2024-10-14 03:21:22,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:21:22" (3/3) ... [2024-10-14 03:21:22,275 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-10-14 03:21:22,297 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:21:22,298 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:21:22,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:21:22,383 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;@5b176bae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:21:22,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:21:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 03:21:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 03:21:22,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:22,397 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:21:22,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:22,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:22,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1773256560, now seen corresponding path program 1 times [2024-10-14 03:21:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:22,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709302222] [2024-10-14 03:21:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:22,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:22,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:22,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:21:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:21:22,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:22,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709302222] [2024-10-14 03:21:22,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709302222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:22,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:22,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:21:22,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639415459] [2024-10-14 03:21:22,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:22,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:21:22,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:21:22,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:21:22,649 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:21:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:22,678 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2024-10-14 03:21:22,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:21:22,682 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-14 03:21:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:22,687 INFO L225 Difference]: With dead ends: 62 [2024-10-14 03:21:22,687 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 03:21:22,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:21:22,694 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:22,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:21:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 03:21:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 03:21:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 03:21:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-10-14 03:21:22,738 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2024-10-14 03:21:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:22,739 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-14 03:21:22,739 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:21:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-10-14 03:21:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 03:21:22,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:22,743 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:21:22,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:21:22,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:22,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1634427412, now seen corresponding path program 1 times [2024-10-14 03:21:22,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:22,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073383888] [2024-10-14 03:21:22,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:22,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:21:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:21:23,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:23,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073383888] [2024-10-14 03:21:23,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073383888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:23,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:23,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:21:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890261094] [2024-10-14 03:21:23,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:23,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:21:23,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:23,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:21:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:21:23,125 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:21:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:23,304 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2024-10-14 03:21:23,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:21:23,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-14 03:21:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:23,308 INFO L225 Difference]: With dead ends: 54 [2024-10-14 03:21:23,309 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 03:21:23,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:21:23,312 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:23,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 136 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:21:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 03:21:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-10-14 03:21:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 03:21:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-10-14 03:21:23,337 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 20 [2024-10-14 03:21:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:23,339 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-10-14 03:21:23,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:21:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-10-14 03:21:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:21:23,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:23,341 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:21:23,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:21:23,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:23,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:23,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1846124153, now seen corresponding path program 1 times [2024-10-14 03:21:23,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:23,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672439930] [2024-10-14 03:21:23,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:23,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:21:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:21:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:21:23,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:23,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672439930] [2024-10-14 03:21:23,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672439930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:23,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:23,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:21:23,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338720009] [2024-10-14 03:21:23,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:23,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:21:23,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:23,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:21:23,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:21:23,627 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:21:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:23,698 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2024-10-14 03:21:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:21:23,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-10-14 03:21:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:23,700 INFO L225 Difference]: With dead ends: 53 [2024-10-14 03:21:23,700 INFO L226 Difference]: Without dead ends: 45 [2024-10-14 03:21:23,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:21:23,702 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:23,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 157 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:21:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-14 03:21:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-14 03:21:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 03:21:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-10-14 03:21:23,713 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 23 [2024-10-14 03:21:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:23,714 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-10-14 03:21:23,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:21:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-10-14 03:21:23,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 03:21:23,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:23,716 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:21:23,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:21:23,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:23,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:23,717 INFO L85 PathProgramCache]: Analyzing trace with hash 179298221, now seen corresponding path program 1 times [2024-10-14 03:21:23,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:23,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303849272] [2024-10-14 03:21:23,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:23,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:21:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:21:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:21:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:21:23,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:23,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303849272] [2024-10-14 03:21:23,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303849272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:21:23,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291146532] [2024-10-14 03:21:23,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:23,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:21:23,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:21:23,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:21:24,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:21:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:24,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 03:21:24,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:21:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:21:24,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:21:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291146532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:24,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:21:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2024-10-14 03:21:24,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149504101] [2024-10-14 03:21:24,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:24,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:21:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:24,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:21:24,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:21:24,282 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:21:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:24,491 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-10-14 03:21:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:21:24,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-10-14 03:21:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:24,492 INFO L225 Difference]: With dead ends: 60 [2024-10-14 03:21:24,493 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 03:21:24,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:21:24,494 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:24,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 169 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:21:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 03:21:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2024-10-14 03:21:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 03:21:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-14 03:21:24,522 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2024-10-14 03:21:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:24,522 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-14 03:21:24,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:21:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-14 03:21:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 03:21:24,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:24,530 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:21:24,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:21:24,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:21:24,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:24,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2056086235, now seen corresponding path program 1 times [2024-10-14 03:21:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:21:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418730063] [2024-10-14 03:21:24,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:21:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:24,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:21:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:21:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:21:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:24,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:21:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:24,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:21:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:21:24,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:21:24,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418730063] [2024-10-14 03:21:24,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418730063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:21:24,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008203903] [2024-10-14 03:21:24,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:24,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:21:24,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:21:24,942 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:21:24,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:21:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:25,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 03:21:25,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:21:25,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-14 03:21:25,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-14 03:21:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:21:25,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:21:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008203903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:21:33,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:21:33,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 18 [2024-10-14 03:21:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378190578] [2024-10-14 03:21:33,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 03:21:33,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 03:21:33,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:21:33,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 03:21:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-10-14 03:21:33,526 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 03:21:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:33,821 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-10-14 03:21:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:21:33,822 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 38 [2024-10-14 03:21:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:33,823 INFO L225 Difference]: With dead ends: 38 [2024-10-14 03:21:33,824 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 03:21:33,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:21:33,826 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:33,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 204 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:21:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 03:21:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 03:21:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:21:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 03:21:33,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2024-10-14 03:21:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:33,827 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 03:21:33,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 03:21:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 03:21:33,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 03:21:33,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:21:33,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:21:34,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:21:34,041 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 03:21:34,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 03:21:34,665 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:21:34,689 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.translateTerm(ProcedureContractResult.java:69) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.(ProcedureContractResult.java:59) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-14 03:21:34,691 INFO L158 Benchmark]: Toolchain (without parser) took 13176.88ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 109.3MB in the beginning and 212.6MB in the end (delta: -103.3MB). Peak memory consumption was 123.1MB. Max. memory is 16.1GB. [2024-10-14 03:21:34,692 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:21:34,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.27ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 97.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 03:21:34,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.38ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 95.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:21:34,692 INFO L158 Benchmark]: Boogie Preprocessor took 41.18ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 93.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:21:34,692 INFO L158 Benchmark]: RCFGBuilder took 390.53ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 78.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 03:21:34,693 INFO L158 Benchmark]: TraceAbstraction took 12424.76ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 77.8MB in the beginning and 212.6MB in the end (delta: -134.7MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2024-10-14 03:21:34,694 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.19ms. Allocated memory is still 167.8MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.27ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 97.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.38ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 95.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.18ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 93.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.53ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 78.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12424.76ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 77.8MB in the beginning and 212.6MB in the end (delta: -134.7MB). Peak memory consumption was 91.6MB. 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 - PositiveResult [Line: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 701 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 550 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 483 IncrementalHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 151 mSDtfsCounter, 483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=2, InterpolantAutomatonStates: 38, 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, 5 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 202 ConstructedInterpolants, 13 QuantifiedInterpolants, 649 SizeOfPredicates, 15 NumberOfNonLiveVariables, 315 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 63/78 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-14 03:21:34,725 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:21:36,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:21:37,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 03:21:37,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:21:37,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:21:37,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:21:37,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:21:37,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:21:37,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:21:37,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:21:37,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:21:37,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:21:37,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:21:37,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:21:37,119 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:21:37,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:21:37,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:21:37,124 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:21:37,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:21:37,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:21:37,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:21:37,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:21:37,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:21:37,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 03:21:37,127 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 03:21:37,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:21:37,127 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 03:21:37,127 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:21:37,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:21:37,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:21:37,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:21:37,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:21:37,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:21:37,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:21:37,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:21:37,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:21:37,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:21:37,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:21:37,131 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 03:21:37,131 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 03:21:37,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:21:37,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:21:37,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:21:37,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:21:37,132 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 03:21:37,132 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2024-10-14 03:21:37,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:21:37,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:21:37,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:21:37,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:21:37,491 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:21:37,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-10-14 03:21:39,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:21:39,290 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:21:39,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-10-14 03:21:39,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985dabc35/2066a0f173684f2baaa976522287157d/FLAG094f079a3 [2024-10-14 03:21:39,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985dabc35/2066a0f173684f2baaa976522287157d [2024-10-14 03:21:39,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:21:39,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:21:39,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:21:39,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:21:39,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:21:39,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d9b9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39, skipping insertion in model container [2024-10-14 03:21:39,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:21:39,516 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-10-14 03:21:39,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:21:39,560 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:21:39,575 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-10-14 03:21:39,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:21:39,619 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:21:39,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39 WrapperNode [2024-10-14 03:21:39,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:21:39,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:21:39,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:21:39,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:21:39,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,659 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2024-10-14 03:21:39,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:21:39,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:21:39,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:21:39,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:21:39,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,689 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-14 03:21:39,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:21:39,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:21:39,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:21:39,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:21:39,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (1/1) ... [2024-10-14 03:21:39,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:21:39,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:21:39,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:21:39,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:21:39,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:21:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 03:21:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 03:21:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 03:21:39,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 03:21:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-10-14 03:21:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-10-14 03:21:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 03:21:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 03:21:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 03:21:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:21:39,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:21:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 03:21:39,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 03:21:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 03:21:39,924 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:21:39,926 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:21:40,150 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 03:21:40,150 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:21:40,203 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:21:40,204 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:21:40,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:21:40 BoogieIcfgContainer [2024-10-14 03:21:40,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:21:40,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:21:40,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:21:40,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:21:40,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:21:39" (1/3) ... [2024-10-14 03:21:40,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e4f37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:21:40, skipping insertion in model container [2024-10-14 03:21:40,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:21:39" (2/3) ... [2024-10-14 03:21:40,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e4f37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:21:40, skipping insertion in model container [2024-10-14 03:21:40,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:21:40" (3/3) ... [2024-10-14 03:21:40,218 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-10-14 03:21:40,233 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:21:40,234 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:21:40,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:21:40,294 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;@1921b677, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:21:40,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:21:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 03:21:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 03:21:40,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:40,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:21:40,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:40,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:40,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1773256560, now seen corresponding path program 1 times [2024-10-14 03:21:40,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 03:21:40,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257785942] [2024-10-14 03:21:40,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:40,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 03:21:40,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 03:21:40,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 03:21:40,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 03:21:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:40,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 03:21:40,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:21:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:21:40,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:21:40,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 03:21:40,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257785942] [2024-10-14 03:21:40,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257785942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:40,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:40,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:21:40,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155952958] [2024-10-14 03:21:40,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:40,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:21:40,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 03:21:40,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:21:40,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:21:40,479 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:21:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:40,535 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2024-10-14 03:21:40,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:21:40,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-14 03:21:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:40,547 INFO L225 Difference]: With dead ends: 62 [2024-10-14 03:21:40,548 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 03:21:40,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:21:40,558 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:40,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:21:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 03:21:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 03:21:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 03:21:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-10-14 03:21:40,591 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2024-10-14 03:21:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:40,592 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-14 03:21:40,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:21:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-10-14 03:21:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 03:21:40,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:40,594 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:21:40,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 03:21:40,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 03:21:40,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:40,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:40,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1634427412, now seen corresponding path program 1 times [2024-10-14 03:21:40,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 03:21:40,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34048116] [2024-10-14 03:21:40,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:40,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 03:21:40,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 03:21:40,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 03:21:40,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 03:21:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:40,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 03:21:40,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:21:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:21:41,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:21:41,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 03:21:41,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34048116] [2024-10-14 03:21:41,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34048116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:41,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:41,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:21:41,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391912477] [2024-10-14 03:21:41,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:41,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:21:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 03:21:41,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:21:41,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:21:41,353 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:21:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:41,735 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-10-14 03:21:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:21:41,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-14 03:21:41,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:41,737 INFO L225 Difference]: With dead ends: 48 [2024-10-14 03:21:41,737 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 03:21:41,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:21:41,739 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:41,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 146 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:21:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 03:21:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 03:21:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 03:21:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-10-14 03:21:41,758 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 20 [2024-10-14 03:21:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:41,760 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-14 03:21:41,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 03:21:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-10-14 03:21:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:21:41,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:41,762 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:21:41,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 03:21:41,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 03:21:41,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:41,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1846124153, now seen corresponding path program 1 times [2024-10-14 03:21:41,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 03:21:41,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871753911] [2024-10-14 03:21:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:41,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 03:21:41,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 03:21:41,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 03:21:41,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 03:21:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:42,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 03:21:42,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:21:42,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 03:21:42,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 03:21:42,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2024-10-14 03:21:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:21:42,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:21:42,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 03:21:42,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871753911] [2024-10-14 03:21:42,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871753911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:21:42,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:21:42,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 03:21:42,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324805912] [2024-10-14 03:21:42,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:21:42,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:21:42,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 03:21:42,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:21:42,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:21:42,421 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 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-10-14 03:21:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:42,750 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-10-14 03:21:42,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:21:42,751 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 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) Word has length 23 [2024-10-14 03:21:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:42,754 INFO L225 Difference]: With dead ends: 58 [2024-10-14 03:21:42,754 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 03:21:42,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:21:42,760 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:42,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 224 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:21:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 03:21:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-10-14 03:21:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 03:21:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-10-14 03:21:42,778 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 23 [2024-10-14 03:21:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:42,778 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-10-14 03:21:42,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 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-10-14 03:21:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-10-14 03:21:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 03:21:42,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:42,779 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:21:42,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 03:21:42,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 03:21:42,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:42,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash 179298221, now seen corresponding path program 1 times [2024-10-14 03:21:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 03:21:42,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43500389] [2024-10-14 03:21:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:42,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 03:21:42,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 03:21:42,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 03:21:42,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 03:21:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:43,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 03:21:43,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:21:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:21:43,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:21:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:21:44,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 03:21:44,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43500389] [2024-10-14 03:21:44,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43500389] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:21:44,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:21:44,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2024-10-14 03:21:44,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412414871] [2024-10-14 03:21:44,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 03:21:44,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 03:21:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 03:21:44,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 03:21:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:21:44,014 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 03:21:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:21:45,433 INFO L93 Difference]: Finished difference Result 100 states and 132 transitions. [2024-10-14 03:21:45,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 03:21:45,434 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 35 [2024-10-14 03:21:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:21:45,436 INFO L225 Difference]: With dead ends: 100 [2024-10-14 03:21:45,438 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 03:21:45,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2024-10-14 03:21:45,439 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 71 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:21:45,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 326 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:21:45,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 03:21:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2024-10-14 03:21:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 49 states have internal predecessors, (53), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 03:21:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2024-10-14 03:21:45,463 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 35 [2024-10-14 03:21:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:21:45,463 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2024-10-14 03:21:45,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 03:21:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2024-10-14 03:21:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 03:21:45,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:21:45,465 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:21:45,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 03:21:45,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 03:21:45,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:21:45,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:21:45,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2056086235, now seen corresponding path program 1 times [2024-10-14 03:21:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 03:21:45,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103585019] [2024-10-14 03:21:45,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:21:45,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 03:21:45,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 03:21:45,671 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 03:21:45,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 03:21:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:21:45,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-14 03:21:45,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:21:46,682 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 03:21:46,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 03:21:46,776 INFO L349 Elim1Store]: treesize reduction 58, result has 44.2 percent of original size [2024-10-14 03:21:46,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 58 [2024-10-14 03:21:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:21:47,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:22:01,592 INFO L349 Elim1Store]: treesize reduction 5, result has 92.3 percent of original size [2024-10-14 03:22:01,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 67 [2024-10-14 03:22:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:22:02,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 03:22:02,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103585019] [2024-10-14 03:22:02,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103585019] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:22:02,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:22:02,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2024-10-14 03:22:02,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980577992] [2024-10-14 03:22:02,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 03:22:02,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 03:22:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 03:22:02,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 03:22:02,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=834, Unknown=3, NotChecked=0, Total=930 [2024-10-14 03:22:02,867 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 23 states have internal predecessors, (37), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-14 03:22:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:22:07,110 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2024-10-14 03:22:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 03:22:07,113 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 23 states have internal predecessors, (37), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 38 [2024-10-14 03:22:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:22:07,114 INFO L225 Difference]: With dead ends: 103 [2024-10-14 03:22:07,114 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 03:22:07,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=243, Invalid=2010, Unknown=3, NotChecked=0, Total=2256 [2024-10-14 03:22:07,116 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 52 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:22:07,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 368 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 03:22:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 03:22:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2024-10-14 03:22:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 60 states have internal predecessors, (62), 24 states have call successors, (24), 10 states have call predecessors, (24), 12 states have return successors, (28), 20 states have call predecessors, (28), 23 states have call successors, (28) [2024-10-14 03:22:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2024-10-14 03:22:07,151 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 38 [2024-10-14 03:22:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:22:07,152 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2024-10-14 03:22:07,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 23 states have internal predecessors, (37), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-14 03:22:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2024-10-14 03:22:07,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 03:22:07,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:22:07,154 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:22:07,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 03:22:07,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 03:22:07,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:22:07,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:22:07,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1541112042, now seen corresponding path program 1 times [2024-10-14 03:22:07,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 03:22:07,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627622607] [2024-10-14 03:22:07,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:22:07,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 03:22:07,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 03:22:07,361 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 03:22:07,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 03:22:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:07,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 03:22:07,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:22:07,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 03:22:07,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-10-14 03:22:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 03:22:07,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:22:08,501 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2024-10-14 03:22:08,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 95 [2024-10-14 03:22:09,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 03:22:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627622607] [2024-10-14 03:22:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627622607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:22:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [530057847] [2024-10-14 03:22:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:22:09,308 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 03:22:09,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 03:22:09,311 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 03:22:09,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-14 03:22:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:22:09,374 WARN L253 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-14 03:22:09,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:22:09,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-14 03:22:13,508 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-10-14 03:22:14,556 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 03:22:14,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2024-10-14 03:22:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2024-10-14 03:22:14,668 INFO L311 TraceCheckSpWp]: Computing backward predicates...