./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.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 aab72618ab8befdf7d3c20393ae3aa97ba59d5fce32037d3e275043b0cba9f2d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:43:42,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:43:42,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:43:42,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:43:42,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:43:42,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:43:42,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:43:42,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:43:42,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:43:42,896 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:43:42,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:43:42,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:43:42,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:43:42,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:43:42,897 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:43:42,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:43:42,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:43:42,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:43:42,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:43:42,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:43:42,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:43:42,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:43:42,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:43:42,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:43:42,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:43:42,904 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:43:42,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:43:42,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:43:42,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:43:42,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:43:42,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:43:42,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:43:42,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:43:42,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:43:42,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:43:42,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:43:42,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:43:42,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:43:42,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:43:42,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:43:42,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:43:42,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:43:42,910 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 -> aab72618ab8befdf7d3c20393ae3aa97ba59d5fce32037d3e275043b0cba9f2d [2024-11-08 14:43:43,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:43:43,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:43:43,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:43:43,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:43:43,178 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:43:43,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c [2024-11-08 14:43:44,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:43:44,826 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:43:44,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c [2024-11-08 14:43:44,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44313c1d/4d8a689aefd240c28c4b7c0c7f7abb5e/FLAGe24b2fcc6 [2024-11-08 14:43:44,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44313c1d/4d8a689aefd240c28c4b7c0c7f7abb5e [2024-11-08 14:43:44,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:43:44,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:43:44,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:43:44,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:43:44,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:43:44,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:43:44" (1/1) ... [2024-11-08 14:43:44,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb78504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:44, skipping insertion in model container [2024-11-08 14:43:44,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:43:44" (1/1) ... [2024-11-08 14:43:44,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:43:45,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c[458,471] [2024-11-08 14:43:45,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:43:45,102 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:43:45,115 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c[458,471] [2024-11-08 14:43:45,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:43:45,155 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:43:45,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45 WrapperNode [2024-11-08 14:43:45,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:43:45,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:43:45,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:43:45,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:43:45,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,208 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2024-11-08 14:43:45,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:43:45,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:43:45,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:43:45,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:43:45,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,228 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 14:43:45,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:43:45,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:43:45,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:43:45,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:43:45,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (1/1) ... [2024-11-08 14:43:45,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:43:45,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:43:45,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 14:43:45,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 14:43:45,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:43:45,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:43:45,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:43:45,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:43:45,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 14:43:45,324 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 14:43:45,392 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:43:45,397 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:43:45,551 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-08 14:43:45,553 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:43:45,565 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:43:45,565 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:43:45,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:43:45 BoogieIcfgContainer [2024-11-08 14:43:45,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:43:45,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:43:45,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:43:45,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:43:45,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:43:44" (1/3) ... [2024-11-08 14:43:45,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5b1992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:43:45, skipping insertion in model container [2024-11-08 14:43:45,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:45" (2/3) ... [2024-11-08 14:43:45,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5b1992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:43:45, skipping insertion in model container [2024-11-08 14:43:45,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:43:45" (3/3) ... [2024-11-08 14:43:45,576 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound100.c [2024-11-08 14:43:45,592 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:43:45,593 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:43:45,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:43:45,667 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;@e8e975e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:43:45,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:43:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:43:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 14:43:45,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:45,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:45,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:45,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:45,685 INFO L85 PathProgramCache]: Analyzing trace with hash -579246775, now seen corresponding path program 1 times [2024-11-08 14:43:45,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:43:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297247997] [2024-11-08 14:43:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:43:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:45,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:43:45,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297247997] [2024-11-08 14:43:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297247997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:43:45,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:43:45,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 14:43:45,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120388914] [2024-11-08 14:43:45,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:43:45,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 14:43:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:43:45,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 14:43:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:43:45,886 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:45,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:43:45,900 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2024-11-08 14:43:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 14:43:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 14:43:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:43:45,907 INFO L225 Difference]: With dead ends: 37 [2024-11-08 14:43:45,907 INFO L226 Difference]: Without dead ends: 16 [2024-11-08 14:43:45,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:43:45,913 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:43:45,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:43:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-08 14:43:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-08 14:43:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:43:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-08 14:43:45,941 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2024-11-08 14:43:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:43:45,941 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-08 14:43:45,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-11-08 14:43:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 14:43:45,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:45,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:45,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:43:45,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:45,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1986551203, now seen corresponding path program 1 times [2024-11-08 14:43:45,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:43:45,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356955603] [2024-11-08 14:43:45,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:45,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:43:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:46,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:43:46,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356955603] [2024-11-08 14:43:46,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356955603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:43:46,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:43:46,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:43:46,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181380629] [2024-11-08 14:43:46,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:43:46,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 14:43:46,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:43:46,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 14:43:46,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:43:46,052 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:43:46,081 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-11-08 14:43:46,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 14:43:46,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 14:43:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:43:46,083 INFO L225 Difference]: With dead ends: 26 [2024-11-08 14:43:46,083 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 14:43:46,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:43:46,086 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:43:46,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:43:46,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 14:43:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 14:43:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:43:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-08 14:43:46,092 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2024-11-08 14:43:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:43:46,092 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-08 14:43:46,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-08 14:43:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 14:43:46,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:46,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:46,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:43:46,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:46,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:46,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1984763743, now seen corresponding path program 1 times [2024-11-08 14:43:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:43:46,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807710816] [2024-11-08 14:43:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:46,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:43:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:43:46,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158734760] [2024-11-08 14:43:46,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:46,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:43:46,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:43:46,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:43:46,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 14:43:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:46,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 14:43:46,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:43:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:46,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:43:46,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:43:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807710816] [2024-11-08 14:43:46,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:43:46,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158734760] [2024-11-08 14:43:46,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158734760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:43:46,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:43:46,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:43:46,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573839311] [2024-11-08 14:43:46,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:43:46,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:43:46,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:43:46,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:43:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:43:46,309 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:43:46,384 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-08 14:43:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:43:46,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 14:43:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:43:46,389 INFO L225 Difference]: With dead ends: 28 [2024-11-08 14:43:46,389 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 14:43:46,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:43:46,390 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:43:46,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:43:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 14:43:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-08 14:43:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:43:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-08 14:43:46,401 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2024-11-08 14:43:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:43:46,401 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-08 14:43:46,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-08 14:43:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:43:46,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:46,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:46,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 14:43:46,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:43:46,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:46,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash -69803837, now seen corresponding path program 1 times [2024-11-08 14:43:46,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:43:46,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006309829] [2024-11-08 14:43:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:46,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:43:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:46,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:43:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:46,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:43:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006309829] [2024-11-08 14:43:46,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006309829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:43:46,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258400794] [2024-11-08 14:43:46,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:46,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:43:46,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:43:46,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:43:46,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 14:43:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:46,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 14:43:46,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:43:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:46,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:43:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:46,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258400794] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:43:46,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:43:46,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-08 14:43:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081350460] [2024-11-08 14:43:46,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:43:46,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 14:43:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:43:46,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 14:43:46,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:43:46,919 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 14:43:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:43:47,005 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-11-08 14:43:47,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:43:47,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2024-11-08 14:43:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:43:47,008 INFO L225 Difference]: With dead ends: 58 [2024-11-08 14:43:47,008 INFO L226 Difference]: Without dead ends: 50 [2024-11-08 14:43:47,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:43:47,010 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:43:47,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:43:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-08 14:43:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-11-08 14:43:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 14:43:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-11-08 14:43:47,021 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 18 [2024-11-08 14:43:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:43:47,021 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-11-08 14:43:47,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 14:43:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-11-08 14:43:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:43:47,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:47,023 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:47,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 14:43:47,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 14:43:47,227 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:47,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:47,228 INFO L85 PathProgramCache]: Analyzing trace with hash -68016377, now seen corresponding path program 1 times [2024-11-08 14:43:47,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:43:47,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497916362] [2024-11-08 14:43:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:43:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:43:47,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444227090] [2024-11-08 14:43:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:47,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:43:47,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:43:47,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:43:47,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 14:43:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:47,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 14:43:47,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:43:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:47,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:43:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:43:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:43:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497916362] [2024-11-08 14:43:47,446 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:43:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444227090] [2024-11-08 14:43:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444227090] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 14:43:47,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:43:47,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-08 14:43:47,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720571153] [2024-11-08 14:43:47,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:43:47,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:43:47,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:43:47,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:43:47,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:43:47,448 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:43:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:43:47,498 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-11-08 14:43:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:43:47,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-08 14:43:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:43:47,500 INFO L225 Difference]: With dead ends: 60 [2024-11-08 14:43:47,500 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 14:43:47,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:43:47,501 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:43:47,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:43:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 14:43:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2024-11-08 14:43:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 14:43:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-08 14:43:47,520 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 18 [2024-11-08 14:43:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:43:47,520 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-08 14:43:47,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:43:47,520 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-08 14:43:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 14:43:47,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:47,523 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:47,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 14:43:47,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:43:47,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:47,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:47,728 INFO L85 PathProgramCache]: Analyzing trace with hash 156635680, now seen corresponding path program 1 times [2024-11-08 14:43:47,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:43:47,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908903587] [2024-11-08 14:43:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:47,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:43:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:43:47,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915922715] [2024-11-08 14:43:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:47,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:43:47,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:43:47,757 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:43:47,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 14:43:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:47,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 14:43:47,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:43:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 14:43:47,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:43:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 14:43:48,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:43:48,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908903587] [2024-11-08 14:43:48,052 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:43:48,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915922715] [2024-11-08 14:43:48,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915922715] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:43:48,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:43:48,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-08 14:43:48,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935471092] [2024-11-08 14:43:48,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:43:48,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:43:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:43:48,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:43:48,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:43:48,056 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 10 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:43:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:43:48,170 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-11-08 14:43:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:43:48,170 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2024-11-08 14:43:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:43:48,171 INFO L225 Difference]: With dead ends: 55 [2024-11-08 14:43:48,171 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 14:43:48,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:43:48,173 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:43:48,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:43:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 14:43:48,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 14:43:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:43:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-11-08 14:43:48,191 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 29 [2024-11-08 14:43:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:43:48,191 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-08 14:43:48,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:43:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-08 14:43:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 14:43:48,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:48,193 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:48,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 14:43:48,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:43:48,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:48,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1854611729, now seen corresponding path program 1 times [2024-11-08 14:43:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:43:48,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784373608] [2024-11-08 14:43:48,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:48,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:43:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:48,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:43:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:48,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:43:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:48,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:43:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:43:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:48,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 14:43:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 14:43:48,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:43:48,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784373608] [2024-11-08 14:43:48,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784373608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:43:48,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023992083] [2024-11-08 14:43:48,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:48,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:43:48,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:43:48,624 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:43:48,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 14:43:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:48,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 14:43:48,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:43:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 14:43:48,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:43:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 14:43:48,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023992083] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:43:48,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:43:48,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-08 14:43:48,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198491029] [2024-11-08 14:43:48,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:43:48,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 14:43:48,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:43:48,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 14:43:48,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:43:48,862 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-11-08 14:43:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:43:49,109 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2024-11-08 14:43:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 14:43:49,110 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) Word has length 47 [2024-11-08 14:43:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:43:49,111 INFO L225 Difference]: With dead ends: 132 [2024-11-08 14:43:49,111 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 14:43:49,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:43:49,112 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 77 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:43:49,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 106 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:43:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 14:43:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2024-11-08 14:43:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 14:43:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2024-11-08 14:43:49,154 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 47 [2024-11-08 14:43:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:43:49,154 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2024-11-08 14:43:49,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-11-08 14:43:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2024-11-08 14:43:49,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 14:43:49,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:49,157 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:49,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 14:43:49,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:43:49,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:49,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:49,358 INFO L85 PathProgramCache]: Analyzing trace with hash 348710830, now seen corresponding path program 2 times [2024-11-08 14:43:49,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:43:49,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254083274] [2024-11-08 14:43:49,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:49,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:43:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:43:49,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [851079159] [2024-11-08 14:43:49,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:43:49,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:43:49,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:43:49,415 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:43:49,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 14:43:49,502 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:43:49,502 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-08 14:43:49,503 WARN L124 FreeRefinementEngine]: Strategy CAMEL was unsuccessful and could not determine trace feasibility [2024-11-08 14:43:49,504 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-11-08 14:43:49,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 14:43:49,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 14:43:49,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:43:49,714 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:49,726 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 14:43:49,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 02:43:49 BoogieIcfgContainer [2024-11-08 14:43:49,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 14:43:49,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 14:43:49,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 14:43:49,730 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 14:43:49,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:43:45" (3/4) ... [2024-11-08 14:43:49,733 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 14:43:49,734 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 14:43:49,734 INFO L158 Benchmark]: Toolchain (without parser) took 4882.15ms. Allocated memory is still 163.6MB. Free memory was 95.7MB in the beginning and 56.1MB in the end (delta: 39.6MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-11-08 14:43:49,734 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:43:49,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.87ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 137.0MB in the end (delta: -41.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-08 14:43:49,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.03ms. Allocated memory is still 163.6MB. Free memory was 137.0MB in the beginning and 135.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:43:49,735 INFO L158 Benchmark]: Boogie Preprocessor took 31.71ms. Allocated memory is still 163.6MB. Free memory was 135.3MB in the beginning and 133.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:43:49,735 INFO L158 Benchmark]: RCFGBuilder took 324.20ms. Allocated memory is still 163.6MB. Free memory was 133.8MB in the beginning and 122.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 14:43:49,736 INFO L158 Benchmark]: TraceAbstraction took 4159.58ms. Allocated memory is still 163.6MB. Free memory was 122.1MB in the beginning and 56.1MB in the end (delta: 66.0MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2024-11-08 14:43:49,736 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 163.6MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:43:49,737 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.18ms. Allocated memory is still 109.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.87ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 137.0MB in the end (delta: -41.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.03ms. Allocated memory is still 163.6MB. Free memory was 137.0MB in the beginning and 135.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.71ms. Allocated memory is still 163.6MB. Free memory was 135.3MB in the beginning and 133.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 324.20ms. Allocated memory is still 163.6MB. Free memory was 133.8MB in the beginning and 122.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4159.58ms. Allocated memory is still 163.6MB. Free memory was 122.1MB in the beginning and 56.1MB in the end (delta: 66.0MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 163.6MB. Free memory is still 56.1MB. There was no memory consumed. 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 - UnprovableResult [Line: 12]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L17] int counter = 0; [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L22] CALL assume_abort_if_not(k <= 256) [L7] COND FALSE !(!cond) [L22] RET assume_abort_if_not(k <= 256) [L24] y = 0 [L25] x = 0 [L26] c = 0 [L28] EXPR counter++ [L28] COND TRUE counter++<100 [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y + x [L28] EXPR counter++ [L28] COND TRUE counter++<100 [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y + x [L28] EXPR counter++ [L28] COND TRUE counter++<100 [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y + x [L28] EXPR counter++ [L28] COND TRUE counter++<100 [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y + x [L28] EXPR counter++ [L28] COND TRUE counter++<100 [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND TRUE !(c < k) [L39] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L39] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L40] CALL __VERIFIER_assert(k*y == y*y) [L10] COND TRUE !(cond) [L12] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 8, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 438 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 313 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 125 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 35 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 968 SizeOfPredicates, 9 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 175/312 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 14:43:49,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.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 aab72618ab8befdf7d3c20393ae3aa97ba59d5fce32037d3e275043b0cba9f2d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:43:51,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:43:52,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 14:43:52,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:43:52,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:43:52,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:43:52,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:43:52,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:43:52,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:43:52,068 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:43:52,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:43:52,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:43:52,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:43:52,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:43:52,070 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:43:52,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:43:52,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:43:52,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:43:52,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:43:52,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:43:52,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:43:52,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:43:52,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:43:52,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 14:43:52,076 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 14:43:52,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:43:52,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 14:43:52,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:43:52,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:43:52,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:43:52,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:43:52,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:43:52,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:43:52,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:43:52,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:43:52,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:43:52,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:43:52,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:43:52,082 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 14:43:52,082 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 14:43:52,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:43:52,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:43:52,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:43:52,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:43:52,084 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 -> aab72618ab8befdf7d3c20393ae3aa97ba59d5fce32037d3e275043b0cba9f2d [2024-11-08 14:43:52,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:43:52,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:43:52,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:43:52,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:43:52,428 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:43:52,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c [2024-11-08 14:43:53,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:43:54,143 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:43:54,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c [2024-11-08 14:43:54,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e2e29be/87628d7e8abc4fa2a4afdaa3a9e98e20/FLAG5a740bc0b [2024-11-08 14:43:54,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e2e29be/87628d7e8abc4fa2a4afdaa3a9e98e20 [2024-11-08 14:43:54,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:43:54,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:43:54,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:43:54,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:43:54,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:43:54,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c608a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54, skipping insertion in model container [2024-11-08 14:43:54,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:43:54,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c[458,471] [2024-11-08 14:43:54,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:43:54,447 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:43:54,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound100.c[458,471] [2024-11-08 14:43:54,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:43:54,494 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:43:54,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54 WrapperNode [2024-11-08 14:43:54,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:43:54,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:43:54,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:43:54,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:43:54,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,527 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2024-11-08 14:43:54,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:43:54,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:43:54,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:43:54,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:43:54,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,564 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 14:43:54,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:43:54,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:43:54,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:43:54,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:43:54,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (1/1) ... [2024-11-08 14:43:54,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:43:54,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:43:54,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 14:43:54,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 14:43:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:43:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 14:43:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:43:54,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:43:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 14:43:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 14:43:54,746 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:43:54,748 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:43:55,247 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-08 14:43:55,247 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:43:55,262 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:43:55,263 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:43:55,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:43:55 BoogieIcfgContainer [2024-11-08 14:43:55,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:43:55,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:43:55,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:43:55,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:43:55,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:43:54" (1/3) ... [2024-11-08 14:43:55,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a755094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:43:55, skipping insertion in model container [2024-11-08 14:43:55,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:43:54" (2/3) ... [2024-11-08 14:43:55,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a755094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:43:55, skipping insertion in model container [2024-11-08 14:43:55,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:43:55" (3/3) ... [2024-11-08 14:43:55,274 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound100.c [2024-11-08 14:43:55,290 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:43:55,290 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:43:55,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:43:55,348 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;@6958bf54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:43:55,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:43:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:43:55,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 14:43:55,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:55,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:55,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:55,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash -579246775, now seen corresponding path program 1 times [2024-11-08 14:43:55,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:43:55,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18732158] [2024-11-08 14:43:55,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:55,391 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-11-08 14:43:55,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:43:55,394 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-11-08 14:43:55,396 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-11-08 14:43:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:55,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 14:43:55,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:43:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:55,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:43:55,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:43:55,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18732158] [2024-11-08 14:43:55,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18732158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:43:55,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:43:55,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 14:43:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565832133] [2024-11-08 14:43:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:43:55,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 14:43:55,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:43:55,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 14:43:55,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:43:55,625 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:43:55,646 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2024-11-08 14:43:55,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 14:43:55,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 14:43:55,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:43:55,657 INFO L225 Difference]: With dead ends: 37 [2024-11-08 14:43:55,657 INFO L226 Difference]: Without dead ends: 16 [2024-11-08 14:43:55,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:43:55,664 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:43:55,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:43:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-08 14:43:55,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-08 14:43:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:43:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-08 14:43:55,701 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2024-11-08 14:43:55,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:43:55,702 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-08 14:43:55,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-11-08 14:43:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 14:43:55,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:55,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:55,716 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-11-08 14:43:55,904 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-11-08 14:43:55,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:55,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:55,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1986551203, now seen corresponding path program 1 times [2024-11-08 14:43:55,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:43:55,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800780259] [2024-11-08 14:43:55,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:55,907 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-11-08 14:43:55,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:43:55,911 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-11-08 14:43:55,915 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-11-08 14:43:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:56,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 14:43:56,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:43:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:56,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:43:56,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:43:56,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800780259] [2024-11-08 14:43:56,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800780259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:43:56,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:43:56,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:43:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485860307] [2024-11-08 14:43:56,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:43:56,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 14:43:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:43:56,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 14:43:56,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:43:56,159 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:43:56,195 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-11-08 14:43:56,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 14:43:56,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 14:43:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:43:56,197 INFO L225 Difference]: With dead ends: 26 [2024-11-08 14:43:56,197 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 14:43:56,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:43:56,199 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:43:56,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:43:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 14:43:56,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-08 14:43:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:43:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-08 14:43:56,206 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2024-11-08 14:43:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:43:56,207 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-08 14:43:56,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-08 14:43:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 14:43:56,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:56,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:56,226 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 (3)] Forceful destruction successful, exit code 0 [2024-11-08 14:43:56,409 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-11-08 14:43:56,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:56,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:56,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1984763743, now seen corresponding path program 1 times [2024-11-08 14:43:56,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:43:56,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643236466] [2024-11-08 14:43:56,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:56,412 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-11-08 14:43:56,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:43:56,415 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-11-08 14:43:56,417 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-11-08 14:43:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:56,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 14:43:56,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:43:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:56,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:43:56,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:43:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643236466] [2024-11-08 14:43:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643236466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:43:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:43:56,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:43:56,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230766203] [2024-11-08 14:43:56,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:43:56,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:43:56,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:43:56,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:43:56,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:43:56,750 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:43:57,850 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-08 14:43:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:43:57,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 14:43:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:43:57,860 INFO L225 Difference]: With dead ends: 28 [2024-11-08 14:43:57,860 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 14:43:57,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:43:57,862 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:43:57,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 14:43:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 14:43:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-08 14:43:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:43:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-08 14:43:57,869 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2024-11-08 14:43:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:43:57,869 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-08 14:43:57,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:43:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-08 14:43:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:43:57,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:43:57,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:43:57,880 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-11-08 14:43:58,071 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-11-08 14:43:58,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:43:58,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:43:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash -69803837, now seen corresponding path program 1 times [2024-11-08 14:43:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:43:58,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589154759] [2024-11-08 14:43:58,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:43:58,073 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-11-08 14:43:58,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:43:58,074 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-11-08 14:43:58,075 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-11-08 14:43:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:43:58,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 14:43:58,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:43:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:58,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:43:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:43:58,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:43:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589154759] [2024-11-08 14:43:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589154759] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:43:58,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:43:58,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2024-11-08 14:43:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473669718] [2024-11-08 14:43:58,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:43:58,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 14:43:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:43:58,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 14:43:58,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:43:58,760 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:44:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:44:05,802 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-11-08 14:44:05,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:44:05,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-08 14:44:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:44:05,816 INFO L225 Difference]: With dead ends: 58 [2024-11-08 14:44:05,816 INFO L226 Difference]: Without dead ends: 50 [2024-11-08 14:44:05,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:44:05,818 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-08 14:44:05,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 70 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-08 14:44:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-08 14:44:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-11-08 14:44:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 14:44:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-11-08 14:44:05,833 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 18 [2024-11-08 14:44:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:44:05,834 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-11-08 14:44:05,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:44:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-11-08 14:44:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:44:05,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:44:05,836 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:44:05,860 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-11-08 14:44:06,036 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-11-08 14:44:06,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:44:06,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:44:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash -68016377, now seen corresponding path program 1 times [2024-11-08 14:44:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:44:06,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573560081] [2024-11-08 14:44:06,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:44:06,038 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-11-08 14:44:06,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:44:06,043 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-11-08 14:44:06,098 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-11-08 14:44:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:44:06,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 14:44:06,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:44:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:44:06,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:44:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:44:21,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:44:21,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573560081] [2024-11-08 14:44:21,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573560081] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 14:44:21,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:44:21,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-08 14:44:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868698058] [2024-11-08 14:44:21,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:44:21,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:44:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:44:21,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:44:21,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 14:44:21,501 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:44:26,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:44:26,934 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-11-08 14:44:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:44:26,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-08 14:44:26,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:44:26,936 INFO L225 Difference]: With dead ends: 60 [2024-11-08 14:44:26,936 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 14:44:26,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:44:26,938 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-08 14:44:26,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-08 14:44:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 14:44:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2024-11-08 14:44:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 14:44:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-08 14:44:26,966 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 18 [2024-11-08 14:44:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:44:26,966 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-08 14:44:26,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:44:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-08 14:44:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 14:44:26,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:44:26,971 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:44:26,996 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-11-08 14:44:27,171 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-11-08 14:44:27,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:44:27,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:44:27,173 INFO L85 PathProgramCache]: Analyzing trace with hash 156635680, now seen corresponding path program 1 times [2024-11-08 14:44:27,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:44:27,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859014752] [2024-11-08 14:44:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:44:27,173 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-11-08 14:44:27,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:44:27,175 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-11-08 14:44:27,176 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-11-08 14:44:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:44:27,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 14:44:27,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:44:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 14:44:28,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:44:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 14:44:38,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:44:38,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859014752] [2024-11-08 14:44:38,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859014752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:44:38,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:44:38,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2024-11-08 14:44:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109130602] [2024-11-08 14:44:38,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:44:38,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 14:44:38,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:44:38,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 14:44:38,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:44:38,584 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:44:50,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 14:44:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:44:51,030 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-11-08 14:44:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 14:44:51,030 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2024-11-08 14:44:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:44:51,031 INFO L225 Difference]: With dead ends: 55 [2024-11-08 14:44:51,031 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 14:44:51,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-08 14:44:51,032 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-08 14:44:51,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 156 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-08 14:44:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 14:44:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 14:44:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:44:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-11-08 14:44:51,046 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 29 [2024-11-08 14:44:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:44:51,047 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-08 14:44:51,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 6 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:44:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-08 14:44:51,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 14:44:51,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:44:51,048 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:44:51,073 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 (7)] Forceful destruction successful, exit code 0 [2024-11-08 14:44:51,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-11-08 14:44:51,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:44:51,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:44:51,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1854611729, now seen corresponding path program 1 times [2024-11-08 14:44:51,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:44:51,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470105094] [2024-11-08 14:44:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:44:51,250 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-11-08 14:44:51,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:44:51,252 INFO L229 MonitoredProcess]: Starting monitored process 8 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-11-08 14:44:51,253 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 (8)] Waiting until timeout for monitored process [2024-11-08 14:44:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:44:52,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 14:44:52,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:44:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 14:44:52,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:44:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 14:44:53,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 14:44:53,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470105094] [2024-11-08 14:44:53,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470105094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:44:53,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:44:53,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-08 14:44:53,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563771455] [2024-11-08 14:44:53,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:44:53,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 14:44:53,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 14:44:53,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 14:44:53,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:44:53,818 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-08 14:45:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:08,796 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2024-11-08 14:45:08,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 14:45:08,807 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 47 [2024-11-08 14:45:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:08,808 INFO L225 Difference]: With dead ends: 132 [2024-11-08 14:45:08,808 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 14:45:08,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=218, Invalid=484, Unknown=0, NotChecked=0, Total=702 [2024-11-08 14:45:08,809 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 96 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:08,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 207 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2024-11-08 14:45:08,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 14:45:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2024-11-08 14:45:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 14:45:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2024-11-08 14:45:08,844 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 47 [2024-11-08 14:45:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:08,845 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2024-11-08 14:45:08,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-08 14:45:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2024-11-08 14:45:08,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 14:45:08,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:08,848 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:45:08,898 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 (8)] Ended with exit code 0 [2024-11-08 14:45:09,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-11-08 14:45:09,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:09,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:09,051 INFO L85 PathProgramCache]: Analyzing trace with hash 348710830, now seen corresponding path program 2 times [2024-11-08 14:45:09,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 14:45:09,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224675724] [2024-11-08 14:45:09,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:45:09,052 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-11-08 14:45:09,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 14:45:09,058 INFO L229 MonitoredProcess]: Starting monitored process 9 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-11-08 14:45:09,059 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 (9)] Waiting until timeout for monitored process [2024-11-08 14:45:09,821 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:45:09,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:45:09,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 14:45:09,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:45:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 14:45:12,385 INFO L311 TraceCheckSpWp]: Computing backward predicates...