./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:56:01,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:56:02,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 11:56:02,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:56:02,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:56:02,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:56:02,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:56:02,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:56:02,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:56:02,049 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:56:02,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:56:02,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:56:02,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:56:02,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:56:02,052 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:56:02,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:56:02,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:56:02,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 11:56:02,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:56:02,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:56:02,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:56:02,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:56:02,056 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:56:02,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:56:02,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:56:02,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:56:02,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:56:02,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:56:02,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:56:02,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:56:02,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:56:02,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:56:02,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:56:02,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 11:56:02,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 11:56:02,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:56:02,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:56:02,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:56:02,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:56:02,058 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d [2024-11-16 11:56:02,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:56:02,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:56:02,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:56:02,282 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:56:02,283 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:56:02,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-16 11:56:03,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:56:03,608 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:56:03,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-16 11:56:03,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b66ab3707/72a5e7e4a47d4cbb8d7914bc692aec29/FLAG03da5a8a7 [2024-11-16 11:56:04,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b66ab3707/72a5e7e4a47d4cbb8d7914bc692aec29 [2024-11-16 11:56:04,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:56:04,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:56:04,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:56:04,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:56:04,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:56:04,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777036da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04, skipping insertion in model container [2024-11-16 11:56:04,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:56:04,178 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-16 11:56:04,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:56:04,281 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:56:04,293 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-16 11:56:04,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:56:04,341 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:56:04,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04 WrapperNode [2024-11-16 11:56:04,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:56:04,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:56:04,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:56:04,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:56:04,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,399 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 457 [2024-11-16 11:56:04,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:56:04,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:56:04,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:56:04,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:56:04,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,454 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-16 11:56:04,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:56:04,499 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:56:04,499 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:56:04,499 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:56:04,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (1/1) ... [2024-11-16 11:56:04,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:56:04,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:56:04,529 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-16 11:56:04,531 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-16 11:56:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:56:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 11:56:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:56:04,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:56:04,661 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:56:04,663 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:56:05,131 INFO L? ?]: Removed 232 outVars from TransFormulas that were not future-live. [2024-11-16 11:56:05,132 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:56:05,168 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:56:05,170 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:56:05,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:56:05 BoogieIcfgContainer [2024-11-16 11:56:05,171 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:56:05,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:56:05,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:56:05,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:56:05,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:56:04" (1/3) ... [2024-11-16 11:56:05,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9cf624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:56:05, skipping insertion in model container [2024-11-16 11:56:05,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:04" (2/3) ... [2024-11-16 11:56:05,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9cf624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:56:05, skipping insertion in model container [2024-11-16 11:56:05,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:56:05" (3/3) ... [2024-11-16 11:56:05,179 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-16 11:56:05,192 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:56:05,193 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:56:05,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:56:05,255 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;@485e7174, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:56:05,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:56:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 120 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 11:56:05,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:05,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:05,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:05,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:05,271 INFO L85 PathProgramCache]: Analyzing trace with hash 44631003, now seen corresponding path program 1 times [2024-11-16 11:56:05,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:05,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813623599] [2024-11-16 11:56:05,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:05,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:05,668 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-16 11:56:05,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:05,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813623599] [2024-11-16 11:56:05,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813623599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:05,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:05,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:56:05,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570373182] [2024-11-16 11:56:05,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:05,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:56:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:05,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:56:05,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:56:05,696 INFO L87 Difference]: Start difference. First operand has 121 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 120 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:05,803 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2024-11-16 11:56:05,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:56:05,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-16 11:56:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:05,813 INFO L225 Difference]: With dead ends: 221 [2024-11-16 11:56:05,813 INFO L226 Difference]: Without dead ends: 118 [2024-11-16 11:56:05,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-16 11:56:05,820 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:05,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 418 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-16 11:56:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-16 11:56:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4700854700854702) internal successors, (172), 117 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-16 11:56:05,851 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 24 [2024-11-16 11:56:05,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:05,852 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-16 11:56:05,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-16 11:56:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 11:56:05,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:05,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:05,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 11:56:05,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:05,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1528614596, now seen corresponding path program 1 times [2024-11-16 11:56:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:05,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064529309] [2024-11-16 11:56:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:05,994 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-16 11:56:05,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:05,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064529309] [2024-11-16 11:56:05,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064529309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:05,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:05,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:56:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732221466] [2024-11-16 11:56:05,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:05,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:56:05,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:05,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:56:05,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:56:06,000 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:06,096 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2024-11-16 11:56:06,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:56:06,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-16 11:56:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:06,097 INFO L225 Difference]: With dead ends: 220 [2024-11-16 11:56:06,097 INFO L226 Difference]: Without dead ends: 120 [2024-11-16 11:56:06,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-16 11:56:06,098 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:06,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-16 11:56:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-16 11:56:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4621848739495797) internal successors, (174), 119 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2024-11-16 11:56:06,108 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 25 [2024-11-16 11:56:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:06,108 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2024-11-16 11:56:06,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2024-11-16 11:56:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 11:56:06,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:06,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:06,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 11:56:06,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:06,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash -110344096, now seen corresponding path program 1 times [2024-11-16 11:56:06,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:06,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562392980] [2024-11-16 11:56:06,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:06,374 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-16 11:56:06,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562392980] [2024-11-16 11:56:06,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562392980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:06,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:06,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:56:06,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187167575] [2024-11-16 11:56:06,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:06,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:56:06,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:06,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:56:06,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:56:06,376 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:06,543 INFO L93 Difference]: Finished difference Result 233 states and 339 transitions. [2024-11-16 11:56:06,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:56:06,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-16 11:56:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:06,545 INFO L225 Difference]: With dead ends: 233 [2024-11-16 11:56:06,545 INFO L226 Difference]: Without dead ends: 131 [2024-11-16 11:56:06,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:56:06,547 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 26 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:06,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 778 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-16 11:56:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-16 11:56:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.449612403100775) internal successors, (187), 129 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 187 transitions. [2024-11-16 11:56:06,553 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 187 transitions. Word has length 26 [2024-11-16 11:56:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:06,553 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 187 transitions. [2024-11-16 11:56:06,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 187 transitions. [2024-11-16 11:56:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-16 11:56:06,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:06,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:06,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 11:56:06,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:06,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:06,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1904569222, now seen corresponding path program 1 times [2024-11-16 11:56:06,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:06,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13837314] [2024-11-16 11:56:06,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:06,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:06,648 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-16 11:56:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:06,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13837314] [2024-11-16 11:56:06,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13837314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:06,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:06,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:56:06,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078683075] [2024-11-16 11:56:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:06,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:56:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:06,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:56:06,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:56:06,650 INFO L87 Difference]: Start difference. First operand 130 states and 187 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:06,792 INFO L93 Difference]: Finished difference Result 302 states and 433 transitions. [2024-11-16 11:56:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:56:06,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-16 11:56:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:06,793 INFO L225 Difference]: With dead ends: 302 [2024-11-16 11:56:06,793 INFO L226 Difference]: Without dead ends: 193 [2024-11-16 11:56:06,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-16 11:56:06,795 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 110 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:06,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 761 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-16 11:56:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 131. [2024-11-16 11:56:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4384615384615385) internal successors, (187), 130 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 187 transitions. [2024-11-16 11:56:06,803 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 187 transitions. Word has length 27 [2024-11-16 11:56:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:06,803 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 187 transitions. [2024-11-16 11:56:06,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 187 transitions. [2024-11-16 11:56:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-16 11:56:06,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:06,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:06,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 11:56:06,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:06,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:06,805 INFO L85 PathProgramCache]: Analyzing trace with hash -716004161, now seen corresponding path program 1 times [2024-11-16 11:56:06,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:06,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970965067] [2024-11-16 11:56:06,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:06,970 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-16 11:56:06,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:06,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970965067] [2024-11-16 11:56:06,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970965067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:06,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:06,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 11:56:06,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025145604] [2024-11-16 11:56:06,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:06,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 11:56:06,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:06,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 11:56:06,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:56:06,974 INFO L87 Difference]: Start difference. First operand 131 states and 187 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:07,182 INFO L93 Difference]: Finished difference Result 309 states and 444 transitions. [2024-11-16 11:56:07,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 11:56:07,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-16 11:56:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:07,184 INFO L225 Difference]: With dead ends: 309 [2024-11-16 11:56:07,184 INFO L226 Difference]: Without dead ends: 207 [2024-11-16 11:56:07,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-16 11:56:07,185 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 129 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:07,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1004 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:56:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-16 11:56:07,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2024-11-16 11:56:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 132 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 189 transitions. [2024-11-16 11:56:07,190 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 189 transitions. Word has length 27 [2024-11-16 11:56:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:07,191 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 189 transitions. [2024-11-16 11:56:07,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 189 transitions. [2024-11-16 11:56:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 11:56:07,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:07,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:07,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 11:56:07,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:07,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:07,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1772649989, now seen corresponding path program 1 times [2024-11-16 11:56:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:07,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438714649] [2024-11-16 11:56:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:07,254 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-16 11:56:07,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:07,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438714649] [2024-11-16 11:56:07,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438714649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:07,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:07,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:56:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156745793] [2024-11-16 11:56:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:07,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:56:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:56:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:56:07,257 INFO L87 Difference]: Start difference. First operand 133 states and 189 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:07,332 INFO L93 Difference]: Finished difference Result 285 states and 407 transitions. [2024-11-16 11:56:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:56:07,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-16 11:56:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:07,333 INFO L225 Difference]: With dead ends: 285 [2024-11-16 11:56:07,333 INFO L226 Difference]: Without dead ends: 174 [2024-11-16 11:56:07,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-16 11:56:07,335 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 89 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:07,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 527 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-16 11:56:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 129. [2024-11-16 11:56:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4296875) internal successors, (183), 128 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 183 transitions. [2024-11-16 11:56:07,339 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 183 transitions. Word has length 28 [2024-11-16 11:56:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:07,340 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 183 transitions. [2024-11-16 11:56:07,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 183 transitions. [2024-11-16 11:56:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-16 11:56:07,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:07,341 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:07,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 11:56:07,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:07,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:07,342 INFO L85 PathProgramCache]: Analyzing trace with hash -652132329, now seen corresponding path program 1 times [2024-11-16 11:56:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:07,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436934486] [2024-11-16 11:56:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:07,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:07,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436934486] [2024-11-16 11:56:07,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436934486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:07,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:07,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:56:07,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018146085] [2024-11-16 11:56:07,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:07,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:56:07,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:07,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:56:07,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:56:07,666 INFO L87 Difference]: Start difference. First operand 129 states and 183 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:07,784 INFO L93 Difference]: Finished difference Result 279 states and 401 transitions. [2024-11-16 11:56:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:56:07,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-16 11:56:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:07,788 INFO L225 Difference]: With dead ends: 279 [2024-11-16 11:56:07,788 INFO L226 Difference]: Without dead ends: 177 [2024-11-16 11:56:07,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-16 11:56:07,789 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 92 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:07,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 667 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-16 11:56:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 146. [2024-11-16 11:56:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.4137931034482758) internal successors, (205), 145 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 205 transitions. [2024-11-16 11:56:07,800 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 205 transitions. Word has length 76 [2024-11-16 11:56:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:07,800 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 205 transitions. [2024-11-16 11:56:07,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 205 transitions. [2024-11-16 11:56:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-16 11:56:07,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:07,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:07,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 11:56:07,805 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:07,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1429659710, now seen corresponding path program 1 times [2024-11-16 11:56:07,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:07,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85073966] [2024-11-16 11:56:07,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:07,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:07,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85073966] [2024-11-16 11:56:07,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85073966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:07,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:07,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:56:07,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550566969] [2024-11-16 11:56:07,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:07,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:56:07,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:07,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:56:07,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:56:07,986 INFO L87 Difference]: Start difference. First operand 146 states and 205 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:08,067 INFO L93 Difference]: Finished difference Result 273 states and 390 transitions. [2024-11-16 11:56:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:56:08,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-16 11:56:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:08,069 INFO L225 Difference]: With dead ends: 273 [2024-11-16 11:56:08,070 INFO L226 Difference]: Without dead ends: 171 [2024-11-16 11:56:08,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-16 11:56:08,071 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 65 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:08,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 514 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-16 11:56:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2024-11-16 11:56:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.4068965517241379) internal successors, (204), 145 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 204 transitions. [2024-11-16 11:56:08,077 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 204 transitions. Word has length 77 [2024-11-16 11:56:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:08,077 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 204 transitions. [2024-11-16 11:56:08,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 204 transitions. [2024-11-16 11:56:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-16 11:56:08,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:08,079 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:08,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 11:56:08,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:08,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2105622877, now seen corresponding path program 1 times [2024-11-16 11:56:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:08,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747279214] [2024-11-16 11:56:08,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:08,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:08,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:08,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747279214] [2024-11-16 11:56:08,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747279214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:08,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:08,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 11:56:08,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12776025] [2024-11-16 11:56:08,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:08,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 11:56:08,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:08,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 11:56:08,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:56:08,458 INFO L87 Difference]: Start difference. First operand 146 states and 204 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:08,532 INFO L93 Difference]: Finished difference Result 256 states and 364 transitions. [2024-11-16 11:56:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:56:08,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-16 11:56:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:08,535 INFO L225 Difference]: With dead ends: 256 [2024-11-16 11:56:08,536 INFO L226 Difference]: Without dead ends: 154 [2024-11-16 11:56:08,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:56:08,537 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 5 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:08,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 549 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-16 11:56:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-11-16 11:56:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4) internal successors, (210), 150 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 210 transitions. [2024-11-16 11:56:08,544 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 210 transitions. Word has length 77 [2024-11-16 11:56:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:08,546 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 210 transitions. [2024-11-16 11:56:08,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 210 transitions. [2024-11-16 11:56:08,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-16 11:56:08,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:08,548 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:08,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 11:56:08,548 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:08,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:08,548 INFO L85 PathProgramCache]: Analyzing trace with hash -654503946, now seen corresponding path program 1 times [2024-11-16 11:56:08,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:08,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002698806] [2024-11-16 11:56:08,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:08,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:09,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002698806] [2024-11-16 11:56:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002698806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:09,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:09,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-16 11:56:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134707549] [2024-11-16 11:56:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:09,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 11:56:09,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:09,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 11:56:09,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-11-16 11:56:09,816 INFO L87 Difference]: Start difference. First operand 151 states and 210 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:10,216 INFO L93 Difference]: Finished difference Result 308 states and 440 transitions. [2024-11-16 11:56:10,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 11:56:10,216 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-16 11:56:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:10,217 INFO L225 Difference]: With dead ends: 308 [2024-11-16 11:56:10,217 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 11:56:10,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-16 11:56:10,218 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 95 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:10,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1439 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 11:56:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 11:56:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2024-11-16 11:56:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 193 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2024-11-16 11:56:10,221 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 78 [2024-11-16 11:56:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:10,222 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2024-11-16 11:56:10,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2024-11-16 11:56:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-16 11:56:10,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:10,222 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:10,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 11:56:10,223 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:10,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:10,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2113381019, now seen corresponding path program 1 times [2024-11-16 11:56:10,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:10,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652520110] [2024-11-16 11:56:10,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:10,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:10,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:10,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652520110] [2024-11-16 11:56:10,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652520110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:10,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:10,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 11:56:10,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013405484] [2024-11-16 11:56:10,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:10,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 11:56:10,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:10,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 11:56:10,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:56:10,478 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:10,624 INFO L93 Difference]: Finished difference Result 319 states and 453 transitions. [2024-11-16 11:56:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 11:56:10,624 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-16 11:56:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:10,625 INFO L225 Difference]: With dead ends: 319 [2024-11-16 11:56:10,625 INFO L226 Difference]: Without dead ends: 212 [2024-11-16 11:56:10,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:56:10,626 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 11 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:10,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1094 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-16 11:56:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2024-11-16 11:56:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4047619047619047) internal successors, (295), 210 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 295 transitions. [2024-11-16 11:56:10,630 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 295 transitions. Word has length 78 [2024-11-16 11:56:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:10,630 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 295 transitions. [2024-11-16 11:56:10,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 295 transitions. [2024-11-16 11:56:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 11:56:10,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:10,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:10,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 11:56:10,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:10,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:10,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2039244954, now seen corresponding path program 1 times [2024-11-16 11:56:10,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:10,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977663559] [2024-11-16 11:56:10,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:10,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:10,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:10,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977663559] [2024-11-16 11:56:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977663559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:10,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:10,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:56:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891383443] [2024-11-16 11:56:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:10,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:56:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:56:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:56:10,912 INFO L87 Difference]: Start difference. First operand 211 states and 295 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:10,984 INFO L93 Difference]: Finished difference Result 341 states and 481 transitions. [2024-11-16 11:56:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:56:10,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-16 11:56:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:10,986 INFO L225 Difference]: With dead ends: 341 [2024-11-16 11:56:10,986 INFO L226 Difference]: Without dead ends: 217 [2024-11-16 11:56:10,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:56:10,986 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:10,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 536 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-16 11:56:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2024-11-16 11:56:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4046511627906977) internal successors, (302), 215 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 302 transitions. [2024-11-16 11:56:10,992 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 302 transitions. Word has length 79 [2024-11-16 11:56:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:10,992 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 302 transitions. [2024-11-16 11:56:10,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 302 transitions. [2024-11-16 11:56:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 11:56:10,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:10,993 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:10,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 11:56:10,993 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:10,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash -414001544, now seen corresponding path program 1 times [2024-11-16 11:56:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179644003] [2024-11-16 11:56:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:11,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:11,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179644003] [2024-11-16 11:56:11,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179644003] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:56:11,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384717419] [2024-11-16 11:56:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:11,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:56:11,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:56:11,390 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-16 11:56:11,391 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-16 11:56:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:11,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-16 11:56:11,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:56:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:12,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:56:12,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384717419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:12,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 11:56:12,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [13] total 28 [2024-11-16 11:56:12,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239369031] [2024-11-16 11:56:12,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:12,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 11:56:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:12,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 11:56:12,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2024-11-16 11:56:12,097 INFO L87 Difference]: Start difference. First operand 216 states and 302 transitions. Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:12,571 INFO L93 Difference]: Finished difference Result 405 states and 572 transitions. [2024-11-16 11:56:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 11:56:12,572 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-16 11:56:12,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:12,573 INFO L225 Difference]: With dead ends: 405 [2024-11-16 11:56:12,573 INFO L226 Difference]: Without dead ends: 278 [2024-11-16 11:56:12,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2024-11-16 11:56:12,574 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 157 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:12,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1346 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 11:56:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-16 11:56:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 254. [2024-11-16 11:56:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.407114624505929) internal successors, (356), 253 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 356 transitions. [2024-11-16 11:56:12,580 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 356 transitions. Word has length 79 [2024-11-16 11:56:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:12,580 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 356 transitions. [2024-11-16 11:56:12,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 356 transitions. [2024-11-16 11:56:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 11:56:12,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:12,581 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:12,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 11:56:12,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-16 11:56:12,782 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:12,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash -805708141, now seen corresponding path program 1 times [2024-11-16 11:56:12,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:12,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816330873] [2024-11-16 11:56:12,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:13,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:13,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816330873] [2024-11-16 11:56:13,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816330873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:13,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:13,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 11:56:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552859037] [2024-11-16 11:56:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:13,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 11:56:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:13,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 11:56:13,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-16 11:56:13,448 INFO L87 Difference]: Start difference. First operand 254 states and 356 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:13,642 INFO L93 Difference]: Finished difference Result 466 states and 657 transitions. [2024-11-16 11:56:13,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 11:56:13,643 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-16 11:56:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:13,644 INFO L225 Difference]: With dead ends: 466 [2024-11-16 11:56:13,644 INFO L226 Difference]: Without dead ends: 337 [2024-11-16 11:56:13,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-16 11:56:13,645 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 57 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:13,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 936 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:56:13,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-16 11:56:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 322. [2024-11-16 11:56:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.4080996884735202) internal successors, (452), 321 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 452 transitions. [2024-11-16 11:56:13,650 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 452 transitions. Word has length 79 [2024-11-16 11:56:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:13,651 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 452 transitions. [2024-11-16 11:56:13,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 452 transitions. [2024-11-16 11:56:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 11:56:13,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:13,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:13,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 11:56:13,652 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:13,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1487485153, now seen corresponding path program 1 times [2024-11-16 11:56:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:13,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445017607] [2024-11-16 11:56:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:13,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:13,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:13,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445017607] [2024-11-16 11:56:13,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445017607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:13,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:13,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:56:13,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685446295] [2024-11-16 11:56:13,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:13,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:56:13,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:13,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:56:13,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:56:13,799 INFO L87 Difference]: Start difference. First operand 322 states and 452 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:13,868 INFO L93 Difference]: Finished difference Result 489 states and 689 transitions. [2024-11-16 11:56:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:56:13,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-16 11:56:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:13,869 INFO L225 Difference]: With dead ends: 489 [2024-11-16 11:56:13,869 INFO L226 Difference]: Without dead ends: 298 [2024-11-16 11:56:13,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:56:13,871 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 48 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:13,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 526 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-16 11:56:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-16 11:56:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.3804713804713804) internal successors, (410), 297 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 410 transitions. [2024-11-16 11:56:13,876 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 410 transitions. Word has length 79 [2024-11-16 11:56:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:13,876 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 410 transitions. [2024-11-16 11:56:13,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 410 transitions. [2024-11-16 11:56:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-16 11:56:13,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:13,877 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:13,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 11:56:13,877 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:13,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2083523798, now seen corresponding path program 1 times [2024-11-16 11:56:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:13,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992840122] [2024-11-16 11:56:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:14,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992840122] [2024-11-16 11:56:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992840122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:14,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:14,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 11:56:14,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573017518] [2024-11-16 11:56:14,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:14,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 11:56:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:14,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 11:56:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-16 11:56:14,328 INFO L87 Difference]: Start difference. First operand 298 states and 410 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:14,619 INFO L93 Difference]: Finished difference Result 530 states and 739 transitions. [2024-11-16 11:56:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 11:56:14,619 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-16 11:56:14,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:14,620 INFO L225 Difference]: With dead ends: 530 [2024-11-16 11:56:14,620 INFO L226 Difference]: Without dead ends: 376 [2024-11-16 11:56:14,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-16 11:56:14,621 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 47 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:14,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1534 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 11:56:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-16 11:56:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 348. [2024-11-16 11:56:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.377521613832853) internal successors, (478), 347 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 478 transitions. [2024-11-16 11:56:14,627 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 478 transitions. Word has length 80 [2024-11-16 11:56:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:14,627 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 478 transitions. [2024-11-16 11:56:14,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 478 transitions. [2024-11-16 11:56:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-16 11:56:14,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:14,630 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:14,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 11:56:14,630 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:14,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash -413411653, now seen corresponding path program 1 times [2024-11-16 11:56:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:14,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212928924] [2024-11-16 11:56:14,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:14,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212928924] [2024-11-16 11:56:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212928924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:14,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:14,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 11:56:14,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156203572] [2024-11-16 11:56:14,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:14,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 11:56:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:14,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 11:56:14,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:56:14,949 INFO L87 Difference]: Start difference. First operand 348 states and 478 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:15,148 INFO L93 Difference]: Finished difference Result 672 states and 928 transitions. [2024-11-16 11:56:15,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 11:56:15,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-16 11:56:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:15,150 INFO L225 Difference]: With dead ends: 672 [2024-11-16 11:56:15,150 INFO L226 Difference]: Without dead ends: 376 [2024-11-16 11:56:15,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-16 11:56:15,151 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 88 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:15,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1009 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:56:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-16 11:56:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 353. [2024-11-16 11:56:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.3721590909090908) internal successors, (483), 352 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 483 transitions. [2024-11-16 11:56:15,156 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 483 transitions. Word has length 80 [2024-11-16 11:56:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:15,157 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 483 transitions. [2024-11-16 11:56:15,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 483 transitions. [2024-11-16 11:56:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 11:56:15,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:15,158 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:15,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 11:56:15,158 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:15,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 17914773, now seen corresponding path program 1 times [2024-11-16 11:56:15,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:15,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077107541] [2024-11-16 11:56:15,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:15,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077107541] [2024-11-16 11:56:15,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077107541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:56:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439745022] [2024-11-16 11:56:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:56:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:56:15,554 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-16 11:56:15,555 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-16 11:56:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:15,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-16 11:56:15,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:56:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:16,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:56:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439745022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:16,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 11:56:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 25 [2024-11-16 11:56:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395760133] [2024-11-16 11:56:16,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:16,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 11:56:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:16,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 11:56:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2024-11-16 11:56:16,010 INFO L87 Difference]: Start difference. First operand 353 states and 483 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:16,265 INFO L93 Difference]: Finished difference Result 616 states and 862 transitions. [2024-11-16 11:56:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 11:56:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-16 11:56:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:16,267 INFO L225 Difference]: With dead ends: 616 [2024-11-16 11:56:16,267 INFO L226 Difference]: Without dead ends: 421 [2024-11-16 11:56:16,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2024-11-16 11:56:16,268 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 66 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:16,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1385 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:56:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-16 11:56:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 389. [2024-11-16 11:56:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.3737113402061856) internal successors, (533), 388 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 533 transitions. [2024-11-16 11:56:16,273 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 533 transitions. Word has length 81 [2024-11-16 11:56:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:16,273 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 533 transitions. [2024-11-16 11:56:16,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 533 transitions. [2024-11-16 11:56:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 11:56:16,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:16,274 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:16,290 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-16 11:56:16,475 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,SelfDestructingSolverStorable17 [2024-11-16 11:56:16,475 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:16,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash -285170826, now seen corresponding path program 1 times [2024-11-16 11:56:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:16,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211539824] [2024-11-16 11:56:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:16,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211539824] [2024-11-16 11:56:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211539824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:16,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:16,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 11:56:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964335704] [2024-11-16 11:56:16,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:16,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 11:56:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:16,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 11:56:16,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-16 11:56:16,879 INFO L87 Difference]: Start difference. First operand 389 states and 533 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:17,040 INFO L93 Difference]: Finished difference Result 620 states and 861 transitions. [2024-11-16 11:56:17,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 11:56:17,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-16 11:56:17,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:17,042 INFO L225 Difference]: With dead ends: 620 [2024-11-16 11:56:17,042 INFO L226 Difference]: Without dead ends: 425 [2024-11-16 11:56:17,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-16 11:56:17,043 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 29 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:17,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1022 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-16 11:56:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 418. [2024-11-16 11:56:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.3764988009592327) internal successors, (574), 417 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 574 transitions. [2024-11-16 11:56:17,049 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 574 transitions. Word has length 81 [2024-11-16 11:56:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:17,049 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 574 transitions. [2024-11-16 11:56:17,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 574 transitions. [2024-11-16 11:56:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 11:56:17,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:17,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:17,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 11:56:17,050 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:17,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash -235962945, now seen corresponding path program 1 times [2024-11-16 11:56:17,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:17,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246673016] [2024-11-16 11:56:17,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:17,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:17,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246673016] [2024-11-16 11:56:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246673016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:56:17,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120482566] [2024-11-16 11:56:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:17,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:56:17,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:56:17,402 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-16 11:56:17,403 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-16 11:56:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:17,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 11:56:17,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:56:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:17,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:56:17,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120482566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:17,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 11:56:17,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2024-11-16 11:56:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787329305] [2024-11-16 11:56:17,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:17,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 11:56:17,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:17,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 11:56:17,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-16 11:56:17,801 INFO L87 Difference]: Start difference. First operand 418 states and 574 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:17,994 INFO L93 Difference]: Finished difference Result 695 states and 963 transitions. [2024-11-16 11:56:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 11:56:17,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-16 11:56:17,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:17,997 INFO L225 Difference]: With dead ends: 695 [2024-11-16 11:56:17,997 INFO L226 Difference]: Without dead ends: 423 [2024-11-16 11:56:17,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-16 11:56:17,998 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 47 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:17,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1243 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:56:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-16 11:56:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2024-11-16 11:56:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.3578199052132702) internal successors, (573), 422 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 573 transitions. [2024-11-16 11:56:18,007 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 573 transitions. Word has length 81 [2024-11-16 11:56:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:18,007 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 573 transitions. [2024-11-16 11:56:18,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 573 transitions. [2024-11-16 11:56:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 11:56:18,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:18,008 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:18,022 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-16 11:56:18,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:56:18,209 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:18,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:18,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1043857735, now seen corresponding path program 1 times [2024-11-16 11:56:18,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:18,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732573531] [2024-11-16 11:56:18,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:18,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732573531] [2024-11-16 11:56:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732573531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:56:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288197408] [2024-11-16 11:56:18,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:18,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:56:18,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:56:18,563 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-16 11:56:18,565 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-16 11:56:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:18,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-16 11:56:18,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:56:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:18,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:56:18,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288197408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:18,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 11:56:18,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24 [2024-11-16 11:56:18,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17721784] [2024-11-16 11:56:18,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:18,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 11:56:18,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 11:56:18,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2024-11-16 11:56:18,935 INFO L87 Difference]: Start difference. First operand 423 states and 573 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:19,166 INFO L93 Difference]: Finished difference Result 727 states and 1000 transitions. [2024-11-16 11:56:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 11:56:19,166 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-16 11:56:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:19,167 INFO L225 Difference]: With dead ends: 727 [2024-11-16 11:56:19,168 INFO L226 Difference]: Without dead ends: 499 [2024-11-16 11:56:19,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2024-11-16 11:56:19,168 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 59 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:19,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1449 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:56:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-16 11:56:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 435. [2024-11-16 11:56:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.359447004608295) internal successors, (590), 434 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 590 transitions. [2024-11-16 11:56:19,174 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 590 transitions. Word has length 82 [2024-11-16 11:56:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:19,174 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 590 transitions. [2024-11-16 11:56:19,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 590 transitions. [2024-11-16 11:56:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 11:56:19,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:19,175 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:19,189 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-16 11:56:19,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:56:19,379 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:19,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:19,379 INFO L85 PathProgramCache]: Analyzing trace with hash 523739359, now seen corresponding path program 1 times [2024-11-16 11:56:19,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:19,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720473451] [2024-11-16 11:56:19,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:19,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720473451] [2024-11-16 11:56:19,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720473451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:19,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:19,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 11:56:19,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952704797] [2024-11-16 11:56:19,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:19,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 11:56:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:19,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 11:56:19,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 11:56:19,631 INFO L87 Difference]: Start difference. First operand 435 states and 590 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:19,671 INFO L93 Difference]: Finished difference Result 635 states and 871 transitions. [2024-11-16 11:56:19,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 11:56:19,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-16 11:56:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:19,672 INFO L225 Difference]: With dead ends: 635 [2024-11-16 11:56:19,673 INFO L226 Difference]: Without dead ends: 355 [2024-11-16 11:56:19,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 11:56:19,673 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 2 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:19,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 11:56:19,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-16 11:56:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2024-11-16 11:56:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.3615819209039548) internal successors, (482), 354 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 482 transitions. [2024-11-16 11:56:19,678 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 482 transitions. Word has length 82 [2024-11-16 11:56:19,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:19,678 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 482 transitions. [2024-11-16 11:56:19,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 482 transitions. [2024-11-16 11:56:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 11:56:19,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:19,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:19,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 11:56:19,679 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:19,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:19,679 INFO L85 PathProgramCache]: Analyzing trace with hash 383017928, now seen corresponding path program 1 times [2024-11-16 11:56:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:19,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696560385] [2024-11-16 11:56:19,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:19,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:20,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:20,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696560385] [2024-11-16 11:56:20,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696560385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:20,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:20,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 11:56:20,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633847596] [2024-11-16 11:56:20,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:20,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 11:56:20,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:20,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 11:56:20,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-16 11:56:20,045 INFO L87 Difference]: Start difference. First operand 355 states and 482 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:20,223 INFO L93 Difference]: Finished difference Result 550 states and 757 transitions. [2024-11-16 11:56:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 11:56:20,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-16 11:56:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:20,225 INFO L225 Difference]: With dead ends: 550 [2024-11-16 11:56:20,225 INFO L226 Difference]: Without dead ends: 368 [2024-11-16 11:56:20,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-16 11:56:20,225 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 33 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:20,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1094 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:56:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-16 11:56:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 365. [2024-11-16 11:56:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.35989010989011) internal successors, (495), 364 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 495 transitions. [2024-11-16 11:56:20,230 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 495 transitions. Word has length 82 [2024-11-16 11:56:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:20,230 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 495 transitions. [2024-11-16 11:56:20,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 495 transitions. [2024-11-16 11:56:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 11:56:20,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:20,231 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:20,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 11:56:20,231 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:20,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash -201783636, now seen corresponding path program 1 times [2024-11-16 11:56:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:20,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767703282] [2024-11-16 11:56:20,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:20,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:20,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:20,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767703282] [2024-11-16 11:56:20,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767703282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:56:20,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216259401] [2024-11-16 11:56:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:20,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:56:20,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:56:20,601 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-16 11:56:20,602 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-16 11:56:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:20,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-16 11:56:20,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:56:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:21,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:56:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:22,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216259401] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 11:56:22,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 11:56:22,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [14, 24] total 47 [2024-11-16 11:56:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334060345] [2024-11-16 11:56:22,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:22,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 11:56:22,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:22,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 11:56:22,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1919, Unknown=0, NotChecked=0, Total=2162 [2024-11-16 11:56:22,213 INFO L87 Difference]: Start difference. First operand 365 states and 495 transitions. Second operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:23,157 INFO L93 Difference]: Finished difference Result 892 states and 1228 transitions. [2024-11-16 11:56:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-16 11:56:23,157 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-16 11:56:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:23,160 INFO L225 Difference]: With dead ends: 892 [2024-11-16 11:56:23,160 INFO L226 Difference]: Without dead ends: 700 [2024-11-16 11:56:23,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 127 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=2693, Unknown=0, NotChecked=0, Total=2970 [2024-11-16 11:56:23,164 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 216 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:23,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 2675 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 11:56:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-16 11:56:23,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 590. [2024-11-16 11:56:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.3548387096774193) internal successors, (798), 589 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 798 transitions. [2024-11-16 11:56:23,173 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 798 transitions. Word has length 82 [2024-11-16 11:56:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:23,173 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 798 transitions. [2024-11-16 11:56:23,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 798 transitions. [2024-11-16 11:56:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 11:56:23,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:23,175 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:23,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 11:56:23,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-16 11:56:23,376 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:23,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash 986781425, now seen corresponding path program 1 times [2024-11-16 11:56:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:23,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841526362] [2024-11-16 11:56:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841526362] [2024-11-16 11:56:23,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841526362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:23,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:23,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 11:56:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025373872] [2024-11-16 11:56:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 11:56:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:23,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 11:56:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 11:56:23,659 INFO L87 Difference]: Start difference. First operand 590 states and 798 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:23,875 INFO L93 Difference]: Finished difference Result 1032 states and 1416 transitions. [2024-11-16 11:56:23,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 11:56:23,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-16 11:56:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:23,877 INFO L225 Difference]: With dead ends: 1032 [2024-11-16 11:56:23,877 INFO L226 Difference]: Without dead ends: 725 [2024-11-16 11:56:23,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-16 11:56:23,878 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 136 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:23,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1660 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:56:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-16 11:56:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 608. [2024-11-16 11:56:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 1.3542009884678747) internal successors, (822), 607 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 822 transitions. [2024-11-16 11:56:23,885 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 822 transitions. Word has length 82 [2024-11-16 11:56:23,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:23,885 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 822 transitions. [2024-11-16 11:56:23,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 822 transitions. [2024-11-16 11:56:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 11:56:23,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:23,886 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:23,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 11:56:23,887 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:23,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:23,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1557258129, now seen corresponding path program 1 times [2024-11-16 11:56:23,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:23,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122689803] [2024-11-16 11:56:23,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:23,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:23,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122689803] [2024-11-16 11:56:23,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122689803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:23,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:23,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:56:23,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129418272] [2024-11-16 11:56:23,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:23,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:56:23,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:23,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:56:23,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:56:23,986 INFO L87 Difference]: Start difference. First operand 608 states and 822 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:24,054 INFO L93 Difference]: Finished difference Result 1042 states and 1416 transitions. [2024-11-16 11:56:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:56:24,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-16 11:56:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:24,056 INFO L225 Difference]: With dead ends: 1042 [2024-11-16 11:56:24,056 INFO L226 Difference]: Without dead ends: 603 [2024-11-16 11:56:24,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-16 11:56:24,057 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 50 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:24,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 510 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-16 11:56:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2024-11-16 11:56:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 1.3488372093023255) internal successors, (812), 602 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 812 transitions. [2024-11-16 11:56:24,063 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 812 transitions. Word has length 82 [2024-11-16 11:56:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:24,063 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 812 transitions. [2024-11-16 11:56:24,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 812 transitions. [2024-11-16 11:56:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-16 11:56:24,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:24,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:24,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 11:56:24,064 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:24,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:24,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1849880329, now seen corresponding path program 1 times [2024-11-16 11:56:24,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:24,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457426789] [2024-11-16 11:56:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:24,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:24,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:24,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457426789] [2024-11-16 11:56:24,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457426789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:24,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:24,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-16 11:56:24,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200595825] [2024-11-16 11:56:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:24,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 11:56:24,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:24,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 11:56:24,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-16 11:56:24,675 INFO L87 Difference]: Start difference. First operand 603 states and 812 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:24,986 INFO L93 Difference]: Finished difference Result 988 states and 1343 transitions. [2024-11-16 11:56:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 11:56:24,987 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-16 11:56:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:24,988 INFO L225 Difference]: With dead ends: 988 [2024-11-16 11:56:24,988 INFO L226 Difference]: Without dead ends: 655 [2024-11-16 11:56:24,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-11-16 11:56:24,989 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 56 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:24,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1654 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 11:56:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-16 11:56:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2024-11-16 11:56:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.3394495412844036) internal successors, (876), 654 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 876 transitions. [2024-11-16 11:56:25,000 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 876 transitions. Word has length 83 [2024-11-16 11:56:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:25,000 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 876 transitions. [2024-11-16 11:56:25,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:25,001 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 876 transitions. [2024-11-16 11:56:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-16 11:56:25,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:25,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:25,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 11:56:25,002 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:25,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:25,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1739406934, now seen corresponding path program 1 times [2024-11-16 11:56:25,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:25,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205605476] [2024-11-16 11:56:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:25,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:25,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:25,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205605476] [2024-11-16 11:56:25,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205605476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:56:25,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562339409] [2024-11-16 11:56:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:25,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:56:25,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:56:25,508 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-16 11:56:25,509 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-16 11:56:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:25,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-16 11:56:25,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:56:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:25,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:56:26,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:26,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562339409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:56:26,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 11:56:26,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2024-11-16 11:56:26,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444571304] [2024-11-16 11:56:26,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 11:56:26,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-16 11:56:26,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:26,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-16 11:56:26,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 11:56:26,444 INFO L87 Difference]: Start difference. First operand 655 states and 876 transitions. Second operand has 33 states, 33 states have (on average 5.212121212121212) internal successors, (172), 33 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:27,215 INFO L93 Difference]: Finished difference Result 1100 states and 1497 transitions. [2024-11-16 11:56:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 11:56:27,215 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.212121212121212) internal successors, (172), 33 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-16 11:56:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:27,217 INFO L225 Difference]: With dead ends: 1100 [2024-11-16 11:56:27,217 INFO L226 Difference]: Without dead ends: 775 [2024-11-16 11:56:27,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=1884, Unknown=0, NotChecked=0, Total=2162 [2024-11-16 11:56:27,218 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 501 mSDsluCounter, 2384 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2575 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:27,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2575 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 11:56:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-16 11:56:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 659. [2024-11-16 11:56:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3389057750759878) internal successors, (881), 658 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 881 transitions. [2024-11-16 11:56:27,228 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 881 transitions. Word has length 83 [2024-11-16 11:56:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:27,228 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 881 transitions. [2024-11-16 11:56:27,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.212121212121212) internal successors, (172), 33 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 881 transitions. [2024-11-16 11:56:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-16 11:56:27,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:27,229 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:27,247 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-16 11:56:27,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-16 11:56:27,430 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:27,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1275571693, now seen corresponding path program 1 times [2024-11-16 11:56:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:27,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211784612] [2024-11-16 11:56:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:27,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 11:56:27,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211784612] [2024-11-16 11:56:27,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211784612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:56:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643449408] [2024-11-16 11:56:27,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:27,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:56:27,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:56:27,789 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 11:56:27,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 11:56:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:27,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-16 11:56:27,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:56:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:28,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:56:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:29,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643449408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:56:29,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 11:56:29,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24, 23] total 52 [2024-11-16 11:56:29,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631559930] [2024-11-16 11:56:29,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 11:56:29,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-16 11:56:29,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:29,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-16 11:56:29,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2332, Unknown=0, NotChecked=0, Total=2652 [2024-11-16 11:56:29,262 INFO L87 Difference]: Start difference. First operand 659 states and 881 transitions. Second operand has 52 states, 52 states have (on average 3.7884615384615383) internal successors, (197), 52 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:30,512 INFO L93 Difference]: Finished difference Result 1766 states and 2377 transitions. [2024-11-16 11:56:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-16 11:56:30,512 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.7884615384615383) internal successors, (197), 52 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-16 11:56:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:30,515 INFO L225 Difference]: With dead ends: 1766 [2024-11-16 11:56:30,515 INFO L226 Difference]: Without dead ends: 1154 [2024-11-16 11:56:30,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=620, Invalid=4930, Unknown=0, NotChecked=0, Total=5550 [2024-11-16 11:56:30,517 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 959 mSDsluCounter, 3404 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:30,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 3520 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 11:56:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-16 11:56:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1102. [2024-11-16 11:56:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1101 states have (on average 1.3360581289736604) internal successors, (1471), 1101 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1471 transitions. [2024-11-16 11:56:30,527 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1471 transitions. Word has length 83 [2024-11-16 11:56:30,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:30,527 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1471 transitions. [2024-11-16 11:56:30,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.7884615384615383) internal successors, (197), 52 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1471 transitions. [2024-11-16 11:56:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-16 11:56:30,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:30,528 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:30,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-16 11:56:30,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:56:30,733 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:30,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1965858942, now seen corresponding path program 1 times [2024-11-16 11:56:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:30,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031253206] [2024-11-16 11:56:30,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:30,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:31,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:31,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031253206] [2024-11-16 11:56:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031253206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:31,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:31,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-16 11:56:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095772045] [2024-11-16 11:56:31,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:31,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 11:56:31,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:31,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 11:56:31,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-16 11:56:31,560 INFO L87 Difference]: Start difference. First operand 1102 states and 1471 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:31,878 INFO L93 Difference]: Finished difference Result 1876 states and 2530 transitions. [2024-11-16 11:56:31,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 11:56:31,878 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-16 11:56:31,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:31,881 INFO L225 Difference]: With dead ends: 1876 [2024-11-16 11:56:31,881 INFO L226 Difference]: Without dead ends: 1241 [2024-11-16 11:56:31,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-16 11:56:31,882 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 51 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:31,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1785 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 11:56:31,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-11-16 11:56:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1086. [2024-11-16 11:56:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 1.3345622119815668) internal successors, (1448), 1085 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1448 transitions. [2024-11-16 11:56:31,893 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1448 transitions. Word has length 83 [2024-11-16 11:56:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:31,893 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1448 transitions. [2024-11-16 11:56:31,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1448 transitions. [2024-11-16 11:56:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-16 11:56:31,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:31,895 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:31,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 11:56:31,895 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:31,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1017074216, now seen corresponding path program 1 times [2024-11-16 11:56:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:31,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071128312] [2024-11-16 11:56:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:32,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071128312] [2024-11-16 11:56:32,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071128312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:32,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:32,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:56:32,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469495568] [2024-11-16 11:56:32,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:32,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:56:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:32,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:56:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:56:32,066 INFO L87 Difference]: Start difference. First operand 1086 states and 1448 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:32,155 INFO L93 Difference]: Finished difference Result 2171 states and 2900 transitions. [2024-11-16 11:56:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:56:32,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-16 11:56:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:32,158 INFO L225 Difference]: With dead ends: 2171 [2024-11-16 11:56:32,158 INFO L226 Difference]: Without dead ends: 1124 [2024-11-16 11:56:32,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:56:32,159 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 9 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:32,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 796 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:56:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2024-11-16 11:56:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1121. [2024-11-16 11:56:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.3339285714285714) internal successors, (1494), 1120 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1494 transitions. [2024-11-16 11:56:32,170 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1494 transitions. Word has length 84 [2024-11-16 11:56:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:32,170 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1494 transitions. [2024-11-16 11:56:32,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1494 transitions. [2024-11-16 11:56:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-16 11:56:32,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:32,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:32,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 11:56:32,172 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:32,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:32,173 INFO L85 PathProgramCache]: Analyzing trace with hash 394073291, now seen corresponding path program 1 times [2024-11-16 11:56:32,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:32,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849901576] [2024-11-16 11:56:32,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:32,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:32,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:56:32,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849901576] [2024-11-16 11:56:32,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849901576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:56:32,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722320648] [2024-11-16 11:56:32,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:32,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:56:32,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:56:32,522 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 11:56:32,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 11:56:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:32,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 134 conjuncts are in the unsatisfiable core [2024-11-16 11:56:32,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:56:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:34,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:56:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:56:36,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722320648] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 11:56:36,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 11:56:36,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [13, 30] total 71 [2024-11-16 11:56:36,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943625470] [2024-11-16 11:56:36,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:36,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-16 11:56:36,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:56:36,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-16 11:56:36,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=4609, Unknown=0, NotChecked=0, Total=4970 [2024-11-16 11:56:36,443 INFO L87 Difference]: Start difference. First operand 1121 states and 1494 transitions. Second operand has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:47,065 INFO L93 Difference]: Finished difference Result 2722 states and 3723 transitions. [2024-11-16 11:56:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-16 11:56:47,065 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-16 11:56:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:47,069 INFO L225 Difference]: With dead ends: 2722 [2024-11-16 11:56:47,069 INFO L226 Difference]: Without dead ends: 2062 [2024-11-16 11:56:47,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4889 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=977, Invalid=13303, Unknown=0, NotChecked=0, Total=14280 [2024-11-16 11:56:47,073 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 506 mSDsluCounter, 5722 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 5945 SdHoareTripleChecker+Invalid, 5171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:47,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 5945 Invalid, 5171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-16 11:56:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2024-11-16 11:56:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1441. [2024-11-16 11:56:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1440 states have (on average 1.354861111111111) internal successors, (1951), 1440 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1951 transitions. [2024-11-16 11:56:47,089 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 1951 transitions. Word has length 84 [2024-11-16 11:56:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:47,089 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 1951 transitions. [2024-11-16 11:56:47,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1951 transitions. [2024-11-16 11:56:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-16 11:56:47,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:47,091 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:47,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-16 11:56:47,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-16 11:56:47,295 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:47,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 510557834, now seen corresponding path program 1 times [2024-11-16 11:56:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:56:47,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115271628] [2024-11-16 11:56:47,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:56:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:56:47,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 11:56:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:56:47,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 11:56:47,446 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 11:56:47,447 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 11:56:47,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-16 11:56:47,452 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:47,503 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 11:56:47,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:56:47 BoogieIcfgContainer [2024-11-16 11:56:47,505 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 11:56:47,506 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 11:56:47,506 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 11:56:47,506 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 11:56:47,506 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:56:05" (3/4) ... [2024-11-16 11:56:47,510 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 11:56:47,511 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 11:56:47,511 INFO L158 Benchmark]: Toolchain (without parser) took 43501.60ms. Allocated memory was 153.1MB in the beginning and 771.8MB in the end (delta: 618.7MB). Free memory was 77.5MB in the beginning and 666.3MB in the end (delta: -588.7MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-16 11:56:47,511 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 153.1MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:56:47,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.29ms. Allocated memory is still 153.1MB. Free memory was 77.2MB in the beginning and 118.1MB in the end (delta: -40.9MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-16 11:56:47,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.11ms. Allocated memory is still 153.1MB. Free memory was 118.1MB in the beginning and 107.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 11:56:47,511 INFO L158 Benchmark]: Boogie Preprocessor took 97.99ms. Allocated memory is still 153.1MB. Free memory was 107.7MB in the beginning and 102.0MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 11:56:47,511 INFO L158 Benchmark]: IcfgBuilder took 672.34ms. Allocated memory is still 153.1MB. Free memory was 102.0MB in the beginning and 64.7MB in the end (delta: 37.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-16 11:56:47,512 INFO L158 Benchmark]: TraceAbstraction took 42332.40ms. Allocated memory was 153.1MB in the beginning and 771.8MB in the end (delta: 618.7MB). Free memory was 63.9MB in the beginning and 666.3MB in the end (delta: -602.4MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-16 11:56:47,512 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 771.8MB. Free memory is still 666.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:56:47,512 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.39ms. Allocated memory is still 153.1MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.29ms. Allocated memory is still 153.1MB. Free memory was 77.2MB in the beginning and 118.1MB in the end (delta: -40.9MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.11ms. Allocated memory is still 153.1MB. Free memory was 118.1MB in the beginning and 107.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.99ms. Allocated memory is still 153.1MB. Free memory was 107.7MB in the beginning and 102.0MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 672.34ms. Allocated memory is still 153.1MB. Free memory was 102.0MB in the beginning and 64.7MB in the end (delta: 37.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 42332.40ms. Allocated memory was 153.1MB in the beginning and 771.8MB in the end (delta: 618.7MB). Free memory was 63.9MB in the beginning and 666.3MB in the end (delta: -602.4MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 771.8MB. Free memory is still 666.3MB. 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: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 106, overapproximation of bitwiseAnd at line 111. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_19_arg_0=0, var_19_arg_1=0, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_26_arg_0=-1, var_26_arg_1=0, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-256] [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND FALSE !(!(cond)) [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1, var_43_arg_0=-1, var_43_arg_1=0] [L122] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1] [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_45_arg_0=-1, var_45_arg_1=-1] [L127] EXPR var_45_arg_0 | var_45_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1] [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256, var_47_arg_0=0, var_47_arg_1=0] [L132] EXPR var_47_arg_0 & var_47_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256] [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256, var_48_arg_0=-1, var_48_arg_1=0] [L135] EXPR var_48_arg_0 | var_48_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256] [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_50_arg_0=-256, var_50_arg_1=-256] [L140] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53_arg_0=0, var_53_arg_1=-1] [L146] EXPR var_53_arg_0 | var_53_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255, var_54_arg_0=0, var_54_arg_1=-1] [L149] EXPR var_54_arg_0 & var_54_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255] [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_56_arg_0=255, var_56_arg_1=-1] [L154] EXPR var_56_arg_0 & var_56_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63_arg_0=-1, var_63_arg_1=0] [L168] EXPR var_63_arg_0 | var_63_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0] [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_64_arg_0=0, var_64_arg_1=255] [L171] EXPR var_64_arg_0 | var_64_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255] [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256, var_66_arg_0=0, var_66_arg_1=0] [L176] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256] [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0, var_67_arg_0=-256, var_67_arg_1=0] [L179] EXPR var_67_arg_0 | var_67_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0] [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0, var_68_arg_0=0, var_68_arg_1=-1] [L182] EXPR var_68_arg_0 & var_68_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0] [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255, var_75_arg_0=0, var_75_arg_1=0] [L186] EXPR var_75_arg_0 | var_75_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255] [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1, var_77_arg_0=0, var_77_arg_1=-1] [L191] EXPR var_77_arg_0 & var_77_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1] [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1, var_82_arg_0=255, var_82_arg_1=-1] [L196] EXPR var_82_arg_0 & var_82_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1] [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_92_arg_0=-1, var_92_arg_1=-256] [L201] EXPR var_92_arg_0 & var_92_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_94_arg_0=257, var_94_arg_1=0] [L204] EXPR var_94_arg_0 | var_94_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-2, var_19_arg_0=0, var_19_arg_1=-256, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-2, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-2, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-2, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_26_arg_0=-1, var_26_arg_1=-2, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1] [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.2s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3742 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3742 mSDsluCounter, 41641 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37122 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19016 IncrementalHoareTripleChecker+Invalid, 19096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 4519 mSDtfsCounter, 19016 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1463 GetRequests, 874 SyntacticMatches, 7 SemanticMatches, 582 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8681 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1441occurred in iteration=32, InterpolantAutomatonStates: 410, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 1620 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 2993 NumberOfCodeBlocks, 2993 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3197 ConstructedInterpolants, 0 QuantifiedInterpolants, 17430 SizeOfPredicates, 32 NumberOfNonLiveVariables, 3601 ConjunctsInSsa, 539 ConjunctsInUnsatCore, 44 InterpolantComputations, 30 PerfectInterpolantSequences, 429/461 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-16 11:56:47,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:56:49,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:56:49,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 11:56:49,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:56:49,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:56:49,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:56:49,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:56:49,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:56:49,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:56:49,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:56:49,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:56:49,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:56:49,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:56:49,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:56:49,394 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:56:49,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:56:49,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:56:49,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:56:49,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:56:49,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:56:49,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:56:49,398 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 11:56:49,399 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 11:56:49,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:56:49,399 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 11:56:49,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:56:49,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:56:49,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:56:49,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:56:49,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:56:49,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:56:49,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:56:49,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:56:49,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:56:49,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:56:49,400 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 11:56:49,401 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 11:56:49,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:56:49,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:56:49,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:56:49,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:56:49,402 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d [2024-11-16 11:56:49,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:56:49,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:56:49,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:56:49,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:56:49,674 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:56:49,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-16 11:56:50,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:56:51,118 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:56:51,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-16 11:56:51,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f47485202/107b19f2a7844d4698003f3e013d3db6/FLAG5b27865f7 [2024-11-16 11:56:51,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f47485202/107b19f2a7844d4698003f3e013d3db6 [2024-11-16 11:56:51,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:56:51,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:56:51,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:56:51,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:56:51,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:56:51,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64970029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51, skipping insertion in model container [2024-11-16 11:56:51,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:56:51,332 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-16 11:56:51,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:56:51,397 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:56:51,408 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-16 11:56:51,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:56:51,452 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:56:51,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51 WrapperNode [2024-11-16 11:56:51,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:56:51,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:56:51,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:56:51,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:56:51,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,494 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 241 [2024-11-16 11:56:51,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:56:51,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:56:51,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:56:51,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:56:51,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,528 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-16 11:56:51,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:56:51,551 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:56:51,551 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:56:51,551 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:56:51,552 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (1/1) ... [2024-11-16 11:56:51,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:56:51,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:56:51,580 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-16 11:56:51,582 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-16 11:56:51,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:56:51,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 11:56:51,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:56:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:56:51,696 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:56:51,698 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:56:51,911 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-16 11:56:51,912 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:56:51,921 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:56:51,922 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:56:51,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:56:51 BoogieIcfgContainer [2024-11-16 11:56:51,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:56:51,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:56:51,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:56:51,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:56:51,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:56:51" (1/3) ... [2024-11-16 11:56:51,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d80391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:56:51, skipping insertion in model container [2024-11-16 11:56:51,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:56:51" (2/3) ... [2024-11-16 11:56:51,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d80391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:56:51, skipping insertion in model container [2024-11-16 11:56:51,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:56:51" (3/3) ... [2024-11-16 11:56:51,930 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-16 11:56:51,942 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:56:51,943 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:56:51,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:56:51,993 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;@721faa55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:56:51,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:56:51,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 11:56:52,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:52,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 11:56:52,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:52,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:52,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 11:56:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:56:52,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664046514] [2024-11-16 11:56:52,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:52,018 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-16 11:56:52,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:56:52,021 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-16 11:56:52,022 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-16 11:56:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:56:52,118 WARN L253 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 11:56:52,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:56:52,302 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-16 11:56:52,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:56:52,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:56:52,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664046514] [2024-11-16 11:56:52,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664046514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:56:52,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:56:52,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:56:52,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502969161] [2024-11-16 11:56:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:56:52,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:56:52,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:56:52,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:56:52,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:56:52,329 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:56:52,365 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-16 11:56:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:56:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-16 11:56:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:56:52,373 INFO L225 Difference]: With dead ends: 22 [2024-11-16 11:56:52,373 INFO L226 Difference]: Without dead ends: 11 [2024-11-16 11:56:52,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:56:52,379 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 11:56:52,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 11:56:52,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-16 11:56:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-16 11:56:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 11:56:52,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 11:56:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:56:52,401 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 11:56:52,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:56:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 11:56:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 11:56:52,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:56:52,402 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:56:52,405 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-16 11:56:52,603 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-16 11:56:52,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:56:52,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:56:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 11:56:52,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:56:52,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279849025] [2024-11-16 11:56:52,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:56:52,605 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-16 11:56:52,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:56:52,606 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-16 11:56:52,607 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-16 11:56:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:56:52,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 11:56:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:56:52,803 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-16 11:56:52,803 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 11:56:52,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 11:56:52,810 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-16 11:56:53,007 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-16 11:56:53,011 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-16 11:56:53,029 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 11:56:53,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:56:53 BoogieIcfgContainer [2024-11-16 11:56:53,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 11:56:53,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 11:56:53,032 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 11:56:53,032 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 11:56:53,032 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:56:51" (3/4) ... [2024-11-16 11:56:53,033 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 11:56:53,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 11:56:53,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 11:56:53,081 INFO L158 Benchmark]: Toolchain (without parser) took 1934.49ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 44.5MB in the beginning and 67.1MB in the end (delta: -22.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-16 11:56:53,081 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 81.8MB. Free memory is still 63.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:56:53,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.86ms. Allocated memory is still 81.8MB. Free memory was 44.2MB in the beginning and 53.2MB in the end (delta: -9.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-11-16 11:56:53,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.26ms. Allocated memory is still 81.8MB. Free memory was 53.2MB in the beginning and 50.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 11:56:53,082 INFO L158 Benchmark]: Boogie Preprocessor took 54.17ms. Allocated memory is still 81.8MB. Free memory was 50.6MB in the beginning and 47.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 11:56:53,082 INFO L158 Benchmark]: IcfgBuilder took 371.17ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 47.8MB in the beginning and 79.5MB in the end (delta: -31.7MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-16 11:56:53,082 INFO L158 Benchmark]: TraceAbstraction took 1107.99ms. Allocated memory is still 111.1MB. Free memory was 78.5MB in the beginning and 72.0MB in the end (delta: 6.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-16 11:56:53,082 INFO L158 Benchmark]: Witness Printer took 48.44ms. Allocated memory is still 111.1MB. Free memory was 72.0MB in the beginning and 67.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 11:56:53,083 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.11ms. Allocated memory is still 81.8MB. Free memory is still 63.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.86ms. Allocated memory is still 81.8MB. Free memory was 44.2MB in the beginning and 53.2MB in the end (delta: -9.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.26ms. Allocated memory is still 81.8MB. Free memory was 53.2MB in the beginning and 50.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.17ms. Allocated memory is still 81.8MB. Free memory was 50.6MB in the beginning and 47.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 371.17ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 47.8MB in the beginning and 79.5MB in the end (delta: -31.7MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1107.99ms. Allocated memory is still 111.1MB. Free memory was 78.5MB in the beginning and 72.0MB in the end (delta: 6.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Witness Printer took 48.44ms. Allocated memory is still 111.1MB. Free memory was 72.0MB in the beginning and 67.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND FALSE !(!(cond)) [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 5 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 4 NumberOfNonLiveVariables, 50 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-16 11:56:53,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE