./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.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 b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:12:05,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:12:05,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 07:12:05,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:12:05,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:12:05,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:12:05,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:12:05,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:12:05,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:12:05,726 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:12:05,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:12:05,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:12:05,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:12:05,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:12:05,729 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:12:05,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:12:05,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:12:05,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:12:05,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:12:05,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:12:05,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:12:05,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:12:05,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:12:05,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:12:05,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:12:05,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:12:05,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:12:05,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:12:05,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:12:05,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:12:05,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:12:05,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:12:05,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:12:05,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:12:05,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:12:05,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:12:05,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:12:05,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:12:05,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:12:05,738 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 -> b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 [2024-10-14 07:12:05,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:12:06,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:12:06,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:12:06,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:12:06,013 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:12:06,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-14 07:12:07,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:12:07,826 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:12:07,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-14 07:12:07,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc1a23b2/20a64ba524114ad591230f638c21b15d/FLAGe0c10c2ad [2024-10-14 07:12:08,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc1a23b2/20a64ba524114ad591230f638c21b15d [2024-10-14 07:12:08,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:12:08,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:12:08,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:12:08,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:12:08,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:12:08,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:08,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55765e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08, skipping insertion in model container [2024-10-14 07:12:08,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:08,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:12:08,356 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2024-10-14 07:12:08,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:12:08,739 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:12:08,747 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2024-10-14 07:12:08,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:12:08,990 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:12:08,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08 WrapperNode [2024-10-14 07:12:08,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:12:08,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:12:08,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:12:08,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:12:08,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:09,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:09,717 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4515 [2024-10-14 07:12:09,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:12:09,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:12:09,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:12:09,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:12:09,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:09,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:09,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:09,947 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-10-14 07:12:09,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:09,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:10,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:10,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:10,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:10,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:10,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:12:10,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:12:10,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:12:10,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:12:10,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (1/1) ... [2024-10-14 07:12:10,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:12:10,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:12:10,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:12:10,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:12:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:12:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:12:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:12:10,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:12:11,068 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:12:11,070 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:12:15,166 INFO L? ?]: Removed 2689 outVars from TransFormulas that were not future-live. [2024-10-14 07:12:15,166 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:12:15,273 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:12:15,273 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:12:15,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:12:15 BoogieIcfgContainer [2024-10-14 07:12:15,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:12:15,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:12:15,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:12:15,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:12:15,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:12:08" (1/3) ... [2024-10-14 07:12:15,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422ea0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:12:15, skipping insertion in model container [2024-10-14 07:12:15,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:08" (2/3) ... [2024-10-14 07:12:15,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422ea0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:12:15, skipping insertion in model container [2024-10-14 07:12:15,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:12:15" (3/3) ... [2024-10-14 07:12:15,284 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-14 07:12:15,300 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:12:15,301 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:12:15,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:12:15,418 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;@3b1db349, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:12:15,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:12:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 1348 states, 1346 states have (on average 1.50074294205052) internal successors, (2020), 1347 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 07:12:15,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:15,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:15,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:15,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1557405312, now seen corresponding path program 1 times [2024-10-14 07:12:15,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:15,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223917048] [2024-10-14 07:12:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:16,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:16,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223917048] [2024-10-14 07:12:16,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223917048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:16,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:16,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:12:16,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345233483] [2024-10-14 07:12:16,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:16,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:12:16,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:16,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:12:16,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:12:16,220 INFO L87 Difference]: Start difference. First operand has 1348 states, 1346 states have (on average 1.50074294205052) internal successors, (2020), 1347 states have internal predecessors, (2020), 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 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:16,402 INFO L93 Difference]: Finished difference Result 2644 states and 3964 transitions. [2024-10-14 07:12:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:12:16,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2024-10-14 07:12:16,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:16,429 INFO L225 Difference]: With dead ends: 2644 [2024-10-14 07:12:16,430 INFO L226 Difference]: Without dead ends: 1349 [2024-10-14 07:12:16,436 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-10-14 07:12:16,439 INFO L432 NwaCegarLoop]: 2015 mSDtfsCounter, 0 mSDsluCounter, 4025 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6040 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:16,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6040 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:12:16,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2024-10-14 07:12:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2024-10-14 07:12:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.4985163204747773) internal successors, (2020), 1348 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2020 transitions. [2024-10-14 07:12:16,533 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2020 transitions. Word has length 46 [2024-10-14 07:12:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:16,533 INFO L471 AbstractCegarLoop]: Abstraction has 1349 states and 2020 transitions. [2024-10-14 07:12:16,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2020 transitions. [2024-10-14 07:12:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 07:12:16,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:16,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:16,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:12:16,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:16,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1033228990, now seen corresponding path program 1 times [2024-10-14 07:12:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:16,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632546682] [2024-10-14 07:12:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:16,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632546682] [2024-10-14 07:12:16,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632546682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:16,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:16,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:12:16,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468452166] [2024-10-14 07:12:16,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:16,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:12:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:16,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:12:16,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:12:16,797 INFO L87 Difference]: Start difference. First operand 1349 states and 2020 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:16,907 INFO L93 Difference]: Finished difference Result 2647 states and 3964 transitions. [2024-10-14 07:12:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:12:16,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-10-14 07:12:16,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:16,913 INFO L225 Difference]: With dead ends: 2647 [2024-10-14 07:12:16,913 INFO L226 Difference]: Without dead ends: 1351 [2024-10-14 07:12:16,917 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-10-14 07:12:16,918 INFO L432 NwaCegarLoop]: 2015 mSDtfsCounter, 0 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6037 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:16,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6037 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-10-14 07:12:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2024-10-14 07:12:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1350 states have (on average 1.4977777777777779) internal successors, (2022), 1350 states have internal predecessors, (2022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2022 transitions. [2024-10-14 07:12:16,945 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2022 transitions. Word has length 47 [2024-10-14 07:12:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:16,946 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 2022 transitions. [2024-10-14 07:12:16,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2022 transitions. [2024-10-14 07:12:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 07:12:16,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:16,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:16,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:12:16,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:16,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1231674009, now seen corresponding path program 1 times [2024-10-14 07:12:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:16,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424860890] [2024-10-14 07:12:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:17,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:17,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424860890] [2024-10-14 07:12:17,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424860890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:17,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:17,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:12:17,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423472585] [2024-10-14 07:12:17,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:17,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:12:17,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:17,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:12:17,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:12:17,409 INFO L87 Difference]: Start difference. First operand 1351 states and 2022 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:17,551 INFO L93 Difference]: Finished difference Result 2883 states and 4312 transitions. [2024-10-14 07:12:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:12:17,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2024-10-14 07:12:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:17,558 INFO L225 Difference]: With dead ends: 2883 [2024-10-14 07:12:17,558 INFO L226 Difference]: Without dead ends: 1585 [2024-10-14 07:12:17,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:12:17,563 INFO L432 NwaCegarLoop]: 2004 mSDtfsCounter, 2673 mSDsluCounter, 4009 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2673 SdHoareTripleChecker+Valid, 6013 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:17,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2673 Valid, 6013 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-10-14 07:12:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1361. [2024-10-14 07:12:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1360 states have (on average 1.4970588235294118) internal successors, (2036), 1360 states have internal predecessors, (2036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2036 transitions. [2024-10-14 07:12:17,592 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2036 transitions. Word has length 48 [2024-10-14 07:12:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:17,593 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 2036 transitions. [2024-10-14 07:12:17,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2036 transitions. [2024-10-14 07:12:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 07:12:17,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:17,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:17,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:12:17,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:17,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1394866242, now seen corresponding path program 1 times [2024-10-14 07:12:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:17,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6175681] [2024-10-14 07:12:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:17,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:17,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:17,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6175681] [2024-10-14 07:12:17,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6175681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:17,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:17,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:12:17,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531998318] [2024-10-14 07:12:17,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:17,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:12:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:17,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:12:17,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:12:17,906 INFO L87 Difference]: Start difference. First operand 1361 states and 2036 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:18,014 INFO L93 Difference]: Finished difference Result 2677 states and 4005 transitions. [2024-10-14 07:12:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:12:18,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 49 [2024-10-14 07:12:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:18,020 INFO L225 Difference]: With dead ends: 2677 [2024-10-14 07:12:18,021 INFO L226 Difference]: Without dead ends: 1379 [2024-10-14 07:12:18,022 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-10-14 07:12:18,026 INFO L432 NwaCegarLoop]: 2013 mSDtfsCounter, 12 mSDsluCounter, 8040 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10053 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:18,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10053 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-10-14 07:12:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1376. [2024-10-14 07:12:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1375 states have (on average 1.4952727272727273) internal successors, (2056), 1375 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2056 transitions. [2024-10-14 07:12:18,051 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2056 transitions. Word has length 49 [2024-10-14 07:12:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:18,052 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2056 transitions. [2024-10-14 07:12:18,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2056 transitions. [2024-10-14 07:12:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 07:12:18,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:18,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:18,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:12:18,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:18,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash 410288786, now seen corresponding path program 1 times [2024-10-14 07:12:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:18,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960982939] [2024-10-14 07:12:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:18,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960982939] [2024-10-14 07:12:18,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960982939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:18,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:18,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:12:18,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185112201] [2024-10-14 07:12:18,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:18,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:12:18,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:18,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:12:18,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:12:18,373 INFO L87 Difference]: Start difference. First operand 1376 states and 2056 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:18,514 INFO L93 Difference]: Finished difference Result 2695 states and 4028 transitions. [2024-10-14 07:12:18,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:12:18,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-10-14 07:12:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:18,519 INFO L225 Difference]: With dead ends: 2695 [2024-10-14 07:12:18,520 INFO L226 Difference]: Without dead ends: 1380 [2024-10-14 07:12:18,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:12:18,523 INFO L432 NwaCegarLoop]: 2012 mSDtfsCounter, 1991 mSDsluCounter, 4016 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 6028 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:18,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1991 Valid, 6028 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:12:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-10-14 07:12:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2024-10-14 07:12:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1379 states have (on average 1.4938361131254532) internal successors, (2060), 1379 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2060 transitions. [2024-10-14 07:12:18,551 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2060 transitions. Word has length 50 [2024-10-14 07:12:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:18,551 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2060 transitions. [2024-10-14 07:12:18,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:18,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2060 transitions. [2024-10-14 07:12:18,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 07:12:18,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:18,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:12:18,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:18,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:18,555 INFO L85 PathProgramCache]: Analyzing trace with hash 617706532, now seen corresponding path program 1 times [2024-10-14 07:12:18,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:18,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760408231] [2024-10-14 07:12:18,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760408231] [2024-10-14 07:12:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760408231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:18,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:18,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:12:18,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633809829] [2024-10-14 07:12:18,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:18,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:12:18,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:18,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:12:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:12:18,901 INFO L87 Difference]: Start difference. First operand 1380 states and 2060 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:19,024 INFO L93 Difference]: Finished difference Result 2926 states and 4368 transitions. [2024-10-14 07:12:19,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:12:19,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-10-14 07:12:19,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:19,031 INFO L225 Difference]: With dead ends: 2926 [2024-10-14 07:12:19,031 INFO L226 Difference]: Without dead ends: 1613 [2024-10-14 07:12:19,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:12:19,034 INFO L432 NwaCegarLoop]: 2006 mSDtfsCounter, 2663 mSDsluCounter, 4009 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2663 SdHoareTripleChecker+Valid, 6015 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:19,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2663 Valid, 6015 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2024-10-14 07:12:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1390. [2024-10-14 07:12:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 1.4917206623470123) internal successors, (2072), 1389 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2072 transitions. [2024-10-14 07:12:19,062 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2072 transitions. Word has length 50 [2024-10-14 07:12:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:19,062 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2072 transitions. [2024-10-14 07:12:19,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2072 transitions. [2024-10-14 07:12:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 07:12:19,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:19,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:19,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 07:12:19,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:19,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1480792464, now seen corresponding path program 1 times [2024-10-14 07:12:19,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:19,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439987114] [2024-10-14 07:12:19,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:19,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:19,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439987114] [2024-10-14 07:12:19,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439987114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:19,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:19,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 07:12:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730748735] [2024-10-14 07:12:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:19,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:12:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:12:19,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:12:19,378 INFO L87 Difference]: Start difference. First operand 1390 states and 2072 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:19,531 INFO L93 Difference]: Finished difference Result 2725 states and 4064 transitions. [2024-10-14 07:12:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:12:19,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 51 [2024-10-14 07:12:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:19,537 INFO L225 Difference]: With dead ends: 2725 [2024-10-14 07:12:19,537 INFO L226 Difference]: Without dead ends: 1412 [2024-10-14 07:12:19,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:12:19,540 INFO L432 NwaCegarLoop]: 2008 mSDtfsCounter, 5 mSDsluCounter, 12033 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14041 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:19,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14041 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-14 07:12:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1401. [2024-10-14 07:12:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1400 states have (on average 1.4907142857142857) internal successors, (2087), 1400 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2087 transitions. [2024-10-14 07:12:19,567 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2087 transitions. Word has length 51 [2024-10-14 07:12:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:19,568 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 2087 transitions. [2024-10-14 07:12:19,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2087 transitions. [2024-10-14 07:12:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 07:12:19,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:19,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:19,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 07:12:19,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:19,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:19,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1335622345, now seen corresponding path program 1 times [2024-10-14 07:12:19,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:19,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680402108] [2024-10-14 07:12:19,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:19,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:19,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:19,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680402108] [2024-10-14 07:12:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680402108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:19,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:12:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439633765] [2024-10-14 07:12:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:19,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:12:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:19,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:12:19,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:12:19,948 INFO L87 Difference]: Start difference. First operand 1401 states and 2087 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:20,060 INFO L93 Difference]: Finished difference Result 2735 states and 4079 transitions. [2024-10-14 07:12:20,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:12:20,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 51 [2024-10-14 07:12:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:20,067 INFO L225 Difference]: With dead ends: 2735 [2024-10-14 07:12:20,067 INFO L226 Difference]: Without dead ends: 1414 [2024-10-14 07:12:20,069 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-10-14 07:12:20,071 INFO L432 NwaCegarLoop]: 2009 mSDtfsCounter, 11 mSDsluCounter, 10035 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12044 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:20,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12044 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-10-14 07:12:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1413. [2024-10-14 07:12:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.4886685552407932) internal successors, (2102), 1412 states have internal predecessors, (2102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2102 transitions. [2024-10-14 07:12:20,104 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2102 transitions. Word has length 51 [2024-10-14 07:12:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:20,105 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2102 transitions. [2024-10-14 07:12:20,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2102 transitions. [2024-10-14 07:12:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 07:12:20,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:20,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:20,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 07:12:20,106 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:20,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash -907777260, now seen corresponding path program 1 times [2024-10-14 07:12:20,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:20,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709277393] [2024-10-14 07:12:20,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:20,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:20,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:20,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709277393] [2024-10-14 07:12:20,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709277393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:20,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:20,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 07:12:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121638482] [2024-10-14 07:12:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:20,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 07:12:20,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:20,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 07:12:20,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:12:20,576 INFO L87 Difference]: Start difference. First operand 1413 states and 2102 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:20,945 INFO L93 Difference]: Finished difference Result 2981 states and 4438 transitions. [2024-10-14 07:12:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 07:12:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 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 53 [2024-10-14 07:12:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:20,953 INFO L225 Difference]: With dead ends: 2981 [2024-10-14 07:12:20,954 INFO L226 Difference]: Without dead ends: 1651 [2024-10-14 07:12:20,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-10-14 07:12:20,957 INFO L432 NwaCegarLoop]: 1998 mSDtfsCounter, 2697 mSDsluCounter, 14301 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2697 SdHoareTripleChecker+Valid, 16299 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:20,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2697 Valid, 16299 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:12:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2024-10-14 07:12:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1418. [2024-10-14 07:12:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 1.487649964714185) internal successors, (2108), 1417 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2108 transitions. [2024-10-14 07:12:20,992 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2108 transitions. Word has length 53 [2024-10-14 07:12:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:20,993 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2108 transitions. [2024-10-14 07:12:20,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2108 transitions. [2024-10-14 07:12:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 07:12:20,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:20,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:20,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 07:12:20,995 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:20,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1513427970, now seen corresponding path program 1 times [2024-10-14 07:12:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518080213] [2024-10-14 07:12:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:21,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:21,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518080213] [2024-10-14 07:12:21,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518080213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:21,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:21,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:12:21,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318188445] [2024-10-14 07:12:21,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:21,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:12:21,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:21,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:12:21,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:12:21,291 INFO L87 Difference]: Start difference. First operand 1418 states and 2108 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:21,561 INFO L93 Difference]: Finished difference Result 3039 states and 4525 transitions. [2024-10-14 07:12:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:12:21,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2024-10-14 07:12:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:21,570 INFO L225 Difference]: With dead ends: 3039 [2024-10-14 07:12:21,570 INFO L226 Difference]: Without dead ends: 1697 [2024-10-14 07:12:21,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:12:21,573 INFO L432 NwaCegarLoop]: 2001 mSDtfsCounter, 2862 mSDsluCounter, 5993 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2862 SdHoareTripleChecker+Valid, 7994 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:21,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2862 Valid, 7994 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:12:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-10-14 07:12:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1404. [2024-10-14 07:12:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 1.4903777619387029) internal successors, (2091), 1403 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2091 transitions. [2024-10-14 07:12:21,610 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2091 transitions. Word has length 53 [2024-10-14 07:12:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:21,611 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 2091 transitions. [2024-10-14 07:12:21,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2091 transitions. [2024-10-14 07:12:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 07:12:21,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:21,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:21,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 07:12:21,612 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:21,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -403202932, now seen corresponding path program 1 times [2024-10-14 07:12:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408164443] [2024-10-14 07:12:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:22,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:22,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408164443] [2024-10-14 07:12:22,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408164443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:22,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 07:12:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031378768] [2024-10-14 07:12:22,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:22,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 07:12:22,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 07:12:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:12:22,204 INFO L87 Difference]: Start difference. First operand 1404 states and 2091 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:22,450 INFO L93 Difference]: Finished difference Result 2741 states and 4087 transitions. [2024-10-14 07:12:22,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 07:12:22,450 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 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 54 [2024-10-14 07:12:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:22,456 INFO L225 Difference]: With dead ends: 2741 [2024-10-14 07:12:22,456 INFO L226 Difference]: Without dead ends: 1411 [2024-10-14 07:12:22,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:12:22,459 INFO L432 NwaCegarLoop]: 2004 mSDtfsCounter, 2012 mSDsluCounter, 12015 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 14019 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:22,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 14019 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-10-14 07:12:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1408. [2024-10-14 07:12:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1407 states have (on average 1.4896943852167732) internal successors, (2096), 1407 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2096 transitions. [2024-10-14 07:12:22,493 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2096 transitions. Word has length 54 [2024-10-14 07:12:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:22,494 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 2096 transitions. [2024-10-14 07:12:22,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2096 transitions. [2024-10-14 07:12:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 07:12:22,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:22,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:22,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 07:12:22,495 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:22,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:22,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1950156370, now seen corresponding path program 1 times [2024-10-14 07:12:22,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:22,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100682991] [2024-10-14 07:12:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:22,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:22,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100682991] [2024-10-14 07:12:22,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100682991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:22,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:22,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:12:22,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376496703] [2024-10-14 07:12:22,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:22,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:12:22,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:22,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:12:22,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:12:22,887 INFO L87 Difference]: Start difference. First operand 1408 states and 2096 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:23,033 INFO L93 Difference]: Finished difference Result 2889 states and 4301 transitions. [2024-10-14 07:12:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:12:23,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-10-14 07:12:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:23,040 INFO L225 Difference]: With dead ends: 2889 [2024-10-14 07:12:23,040 INFO L226 Difference]: Without dead ends: 1547 [2024-10-14 07:12:23,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:12:23,044 INFO L432 NwaCegarLoop]: 2001 mSDtfsCounter, 2421 mSDsluCounter, 4001 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 6002 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:23,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2421 Valid, 6002 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-14 07:12:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1400. [2024-10-14 07:12:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1399 states have (on average 1.4910650464617583) internal successors, (2086), 1399 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 2086 transitions. [2024-10-14 07:12:23,075 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 2086 transitions. Word has length 55 [2024-10-14 07:12:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:23,076 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 2086 transitions. [2024-10-14 07:12:23,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 2086 transitions. [2024-10-14 07:12:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 07:12:23,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:23,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:23,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 07:12:23,079 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:23,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1722292558, now seen corresponding path program 1 times [2024-10-14 07:12:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:23,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613520973] [2024-10-14 07:12:23,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:23,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613520973] [2024-10-14 07:12:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613520973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:23,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 07:12:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859869837] [2024-10-14 07:12:23,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:23,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 07:12:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:23,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 07:12:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:12:23,837 INFO L87 Difference]: Start difference. First operand 1400 states and 2086 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:24,250 INFO L93 Difference]: Finished difference Result 2960 states and 4410 transitions. [2024-10-14 07:12:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 07:12:24,251 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 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 55 [2024-10-14 07:12:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:24,257 INFO L225 Difference]: With dead ends: 2960 [2024-10-14 07:12:24,257 INFO L226 Difference]: Without dead ends: 1626 [2024-10-14 07:12:24,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-10-14 07:12:24,261 INFO L432 NwaCegarLoop]: 1995 mSDtfsCounter, 2662 mSDsluCounter, 15956 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 17951 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:24,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 17951 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:12:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-10-14 07:12:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1405. [2024-10-14 07:12:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.4914529914529915) internal successors, (2094), 1404 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2094 transitions. [2024-10-14 07:12:24,292 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2094 transitions. Word has length 55 [2024-10-14 07:12:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:24,292 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2094 transitions. [2024-10-14 07:12:24,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2094 transitions. [2024-10-14 07:12:24,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 07:12:24,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:24,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:24,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 07:12:24,294 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:24,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:24,295 INFO L85 PathProgramCache]: Analyzing trace with hash -661985942, now seen corresponding path program 1 times [2024-10-14 07:12:24,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:24,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461931855] [2024-10-14 07:12:24,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:24,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:12:24,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:12:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:12:24,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:12:24,526 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:12:24,527 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:12:24,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 07:12:24,535 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:24,622 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:12:24,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:12:24 BoogieIcfgContainer [2024-10-14 07:12:24,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:12:24,628 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:12:24,628 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:12:24,628 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:12:24,629 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:12:15" (3/4) ... [2024-10-14 07:12:24,631 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:12:24,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:12:24,633 INFO L158 Benchmark]: Toolchain (without parser) took 16586.64ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 131.7MB in the beginning and 793.0MB in the end (delta: -661.3MB). Peak memory consumption was 304.9MB. Max. memory is 16.1GB. [2024-10-14 07:12:24,633 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 131.3MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:12:24,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 941.68ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 109.0MB in the end (delta: 22.2MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2024-10-14 07:12:24,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 725.25ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 109.0MB in the beginning and 153.1MB in the end (delta: -44.1MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. [2024-10-14 07:12:24,634 INFO L158 Benchmark]: Boogie Preprocessor took 660.20ms. Allocated memory is still 268.4MB. Free memory was 153.1MB in the beginning and 128.2MB in the end (delta: 24.9MB). Peak memory consumption was 84.9MB. Max. memory is 16.1GB. [2024-10-14 07:12:24,634 INFO L158 Benchmark]: RCFGBuilder took 4895.28ms. Allocated memory was 268.4MB in the beginning and 761.3MB in the end (delta: 492.8MB). Free memory was 128.2MB in the beginning and 357.9MB in the end (delta: -229.7MB). Peak memory consumption was 263.0MB. Max. memory is 16.1GB. [2024-10-14 07:12:24,634 INFO L158 Benchmark]: TraceAbstraction took 9350.91ms. Allocated memory was 761.3MB in the beginning and 1.1GB in the end (delta: 371.2MB). Free memory was 357.9MB in the beginning and 793.0MB in the end (delta: -435.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:12:24,634 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 1.1GB. Free memory is still 793.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:12:24,636 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 131.3MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 941.68ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 109.0MB in the end (delta: 22.2MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 725.25ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 109.0MB in the beginning and 153.1MB in the end (delta: -44.1MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 660.20ms. Allocated memory is still 268.4MB. Free memory was 153.1MB in the beginning and 128.2MB in the end (delta: 24.9MB). Peak memory consumption was 84.9MB. Max. memory is 16.1GB. * RCFGBuilder took 4895.28ms. Allocated memory was 268.4MB in the beginning and 761.3MB in the end (delta: 492.8MB). Free memory was 128.2MB in the beginning and 357.9MB in the end (delta: -229.7MB). Peak memory consumption was 263.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9350.91ms. Allocated memory was 761.3MB in the beginning and 1.1GB in the end (delta: 371.2MB). Free memory was 357.9MB in the beginning and 793.0MB in the end (delta: -435.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 1.1GB. Free memory is still 793.0MB. 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 215, overapproximation of bitwiseAnd at line 220. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 3); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (3 - 1); [L35] const SORT_44 mask_SORT_44 = (SORT_44)-1 >> (sizeof(SORT_44) * 8 - 12); [L36] const SORT_44 msb_SORT_44 = (SORT_44)1 << (12 - 1); [L38] const SORT_98 mask_SORT_98 = (SORT_98)-1 >> (sizeof(SORT_98) * 8 - 17); [L39] const SORT_98 msb_SORT_98 = (SORT_98)1 << (17 - 1); [L41] const SORT_99 mask_SORT_99 = (SORT_99)-1 >> (sizeof(SORT_99) * 8 - 5); [L42] const SORT_99 msb_SORT_99 = (SORT_99)1 << (5 - 1); [L44] const SORT_102 mask_SORT_102 = (SORT_102)-1 >> (sizeof(SORT_102) * 8 - 9); [L45] const SORT_102 msb_SORT_102 = (SORT_102)1 << (9 - 1); [L47] const SORT_104 mask_SORT_104 = (SORT_104)-1 >> (sizeof(SORT_104) * 8 - 10); [L48] const SORT_104 msb_SORT_104 = (SORT_104)1 << (10 - 1); [L50] const SORT_107 mask_SORT_107 = (SORT_107)-1 >> (sizeof(SORT_107) * 8 - 11); [L51] const SORT_107 msb_SORT_107 = (SORT_107)1 << (11 - 1); [L53] const SORT_112 mask_SORT_112 = (SORT_112)-1 >> (sizeof(SORT_112) * 8 - 13); [L54] const SORT_112 msb_SORT_112 = (SORT_112)1 << (13 - 1); [L56] const SORT_115 mask_SORT_115 = (SORT_115)-1 >> (sizeof(SORT_115) * 8 - 14); [L57] const SORT_115 msb_SORT_115 = (SORT_115)1 << (14 - 1); [L59] const SORT_118 mask_SORT_118 = (SORT_118)-1 >> (sizeof(SORT_118) * 8 - 15); [L60] const SORT_118 msb_SORT_118 = (SORT_118)1 << (15 - 1); [L62] const SORT_151 mask_SORT_151 = (SORT_151)-1 >> (sizeof(SORT_151) * 8 - 7); [L63] const SORT_151 msb_SORT_151 = (SORT_151)1 << (7 - 1); [L65] const SORT_211 mask_SORT_211 = (SORT_211)-1 >> (sizeof(SORT_211) * 8 - 2); [L66] const SORT_211 msb_SORT_211 = (SORT_211)1 << (2 - 1); [L68] const SORT_370 mask_SORT_370 = (SORT_370)-1 >> (sizeof(SORT_370) * 8 - 4); [L69] const SORT_370 msb_SORT_370 = (SORT_370)1 << (4 - 1); [L71] const SORT_373 mask_SORT_373 = (SORT_373)-1 >> (sizeof(SORT_373) * 8 - 6); [L72] const SORT_373 msb_SORT_373 = (SORT_373)1 << (6 - 1); [L74] const SORT_376 mask_SORT_376 = (SORT_376)-1 >> (sizeof(SORT_376) * 8 - 8); [L75] const SORT_376 msb_SORT_376 = (SORT_376)1 << (8 - 1); [L77] const SORT_3 var_6 = 0; [L78] const SORT_9 var_11 = 2; [L79] const SORT_9 var_13 = 0; [L80] const SORT_1 var_19 = 0; [L81] const SORT_1 var_34 = 1; [L82] const SORT_44 var_45 = 0; [L83] const SORT_9 var_61 = 1; [L84] const SORT_9 var_66 = 4; [L85] const SORT_9 var_68 = 5; [L86] const SORT_9 var_72 = 3; [L87] const SORT_99 var_100 = 0; [L88] const SORT_151 var_153 = 5; [L89] const SORT_151 var_157 = 4; [L90] const SORT_151 var_161 = 3; [L91] const SORT_151 var_165 = 2; [L92] const SORT_151 var_169 = 1; [L93] const SORT_151 var_173 = 0; [L94] const SORT_44 var_196 = 2; [L95] const SORT_211 var_213 = 0; [L96] const SORT_3 var_220 = 65535; [L98] SORT_1 input_2; [L99] SORT_3 input_4; [L100] SORT_3 input_5; [L101] SORT_3 input_208; [L102] SORT_3 input_209; [L103] SORT_3 input_210; [L104] SORT_3 input_219; [L105] SORT_3 input_228; [L106] SORT_3 input_229; [L107] SORT_3 input_230; [L108] SORT_3 input_233; [L109] SORT_3 input_251; [L110] SORT_3 input_252; [L111] SORT_3 input_253; [L112] SORT_3 input_256; [L113] SORT_3 input_258; [L114] SORT_211 input_272; [L115] SORT_211 input_273; [L116] SORT_211 input_274; [L118] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L118] SORT_3 state_7 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L119] SORT_9 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L120] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L121] SORT_3 state_23 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L122] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L122] SORT_3 state_38 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L123] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L123] SORT_3 state_40 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L124] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L124] SORT_3 state_42 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L125] EXPR __VERIFIER_nondet_ushort() & mask_SORT_44 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L125] SORT_44 state_46 = __VERIFIER_nondet_ushort() & mask_SORT_44; [L126] EXPR __VERIFIER_nondet_ushort() & mask_SORT_44 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L126] SORT_44 state_48 = __VERIFIER_nondet_ushort() & mask_SORT_44; [L127] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L127] SORT_3 state_50 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L128] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L128] SORT_3 state_52 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L129] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L129] SORT_3 state_54 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L130] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_45=0, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L130] SORT_3 state_56 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L132] SORT_3 init_8_arg_1 = var_6; [L133] state_7 = init_8_arg_1 [L134] SORT_9 init_15_arg_1 = var_13; [L135] state_14 = init_15_arg_1 [L136] SORT_1 init_21_arg_1 = var_19; [L137] state_20 = init_21_arg_1 [L138] SORT_3 init_24_arg_1 = var_6; [L139] state_23 = init_24_arg_1 [L140] SORT_3 init_39_arg_1 = var_6; [L141] state_38 = init_39_arg_1 [L142] SORT_3 init_41_arg_1 = var_6; [L143] state_40 = init_41_arg_1 [L144] SORT_3 init_43_arg_1 = var_6; [L145] state_42 = init_43_arg_1 [L146] SORT_44 init_47_arg_1 = var_45; [L147] state_46 = init_47_arg_1 [L148] SORT_44 init_49_arg_1 = var_45; [L149] state_48 = init_49_arg_1 [L150] SORT_3 init_51_arg_1 = var_6; [L151] state_50 = init_51_arg_1 [L152] SORT_3 init_53_arg_1 = var_6; [L153] state_52 = init_53_arg_1 [L154] SORT_3 init_55_arg_1 = var_6; [L155] state_54 = init_55_arg_1 [L156] SORT_3 init_57_arg_1 = var_6; [L157] state_56 = init_57_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L160] input_2 = __VERIFIER_nondet_uchar() [L161] input_4 = __VERIFIER_nondet_ushort() [L162] input_5 = __VERIFIER_nondet_ushort() [L163] input_208 = __VERIFIER_nondet_ushort() [L164] input_209 = __VERIFIER_nondet_ushort() [L165] input_210 = __VERIFIER_nondet_ushort() [L166] input_219 = __VERIFIER_nondet_ushort() [L167] input_228 = __VERIFIER_nondet_ushort() [L168] input_229 = __VERIFIER_nondet_ushort() [L169] input_230 = __VERIFIER_nondet_ushort() [L170] input_233 = __VERIFIER_nondet_ushort() [L171] input_251 = __VERIFIER_nondet_ushort() [L172] input_252 = __VERIFIER_nondet_ushort() [L173] input_253 = __VERIFIER_nondet_ushort() [L174] input_256 = __VERIFIER_nondet_ushort() [L175] input_258 = __VERIFIER_nondet_ushort() [L176] input_272 = __VERIFIER_nondet_uchar() [L177] input_273 = __VERIFIER_nondet_uchar() [L178] input_274 = __VERIFIER_nondet_uchar() [L181] SORT_3 var_10_arg_0 = state_7; [L182] SORT_9 var_10 = var_10_arg_0 >> 0; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L183] EXPR var_10 & mask_SORT_9 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L183] var_10 = var_10 & mask_SORT_9 [L184] SORT_9 var_12_arg_0 = var_10; [L185] SORT_9 var_12_arg_1 = var_11; [L186] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L187] SORT_9 var_16_arg_0 = state_14; [L188] SORT_1 var_16 = var_16_arg_0 >> 2; [L189] SORT_1 var_17_arg_0 = var_12; [L190] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_17_arg_0=0, var_17_arg_1=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L191] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L191] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L192] SORT_1 var_18_arg_0 = var_17; [L193] SORT_1 var_18 = ~var_18_arg_0; [L194] SORT_1 var_22_arg_0 = state_20; [L195] SORT_1 var_22 = ~var_22_arg_0; [L196] SORT_3 var_25_arg_0 = state_23; [L197] SORT_3 var_25_arg_1 = var_6; [L198] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L199] SORT_1 var_26_arg_0 = var_22; [L200] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26_arg_0=-1, var_26_arg_1=1, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L201] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L201] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L202] SORT_3 var_27_arg_0 = state_23; [L203] SORT_3 var_27_arg_1 = var_6; [L204] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L205] SORT_1 var_28_arg_0 = var_27; [L206] SORT_1 var_28 = ~var_28_arg_0; [L207] SORT_1 var_29_arg_0 = var_28; [L208] SORT_1 var_29_arg_1 = state_20; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26=255, var_29_arg_0=-2, var_29_arg_1=0, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L209] EXPR var_29_arg_0 | var_29_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_26=255, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L209] SORT_1 var_29 = var_29_arg_0 | var_29_arg_1; [L210] SORT_1 var_30_arg_0 = var_26; [L211] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_30_arg_0=255, var_30_arg_1=254, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L212] EXPR var_30_arg_0 & var_30_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_18=-1, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L212] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L213] SORT_1 var_31_arg_0 = var_18; [L214] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_31_arg_0=-1, var_31_arg_1=1, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L215] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L215] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L216] SORT_1 var_35_arg_0 = var_31; [L217] SORT_1 var_35 = ~var_35_arg_0; [L218] SORT_1 var_36_arg_0 = var_34; [L219] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_36_arg_0=1, var_36_arg_1=-1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L220] EXPR var_36_arg_0 & var_36_arg_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L220] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L221] EXPR var_36 & mask_SORT_1 VAL [mask_SORT_102=511, mask_SORT_104=1023, mask_SORT_107=2047, mask_SORT_112=8191, mask_SORT_115=16383, mask_SORT_118=32767, mask_SORT_151=127, mask_SORT_1=1, mask_SORT_211=3, mask_SORT_370=15, mask_SORT_373=63, mask_SORT_376=255, mask_SORT_3=65535, mask_SORT_44=4095, mask_SORT_99=31, mask_SORT_9=7, state_14=0, state_20=0, state_23=0, state_38=0, state_40=0, state_42=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_7=0, var_100=0, var_10=0, var_11=2, var_13=0, var_153=5, var_157=4, var_161=3, var_165=2, var_169=1, var_173=0, var_196=2, var_19=0, var_213=0, var_220=65535, var_34=1, var_61=1, var_66=4, var_68=5, var_6=0, var_72=3] [L221] var_36 = var_36 & mask_SORT_1 [L222] SORT_1 bad_37_arg_0 = var_36; [L223] CALL __VERIFIER_assert(!(bad_37_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1348 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20009 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20009 mSDsluCounter, 128536 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102455 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 972 IncrementalHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 26081 mSDtfsCounter, 972 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1418occurred in iteration=9, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1359 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 2324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 could not prove your program: unable to determine feasibility of some traces [2024-10-14 07:12:24,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.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 b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:12:27,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:12:27,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 07:12:27,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:12:27,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:12:27,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:12:27,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:12:27,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:12:27,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:12:27,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:12:27,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:12:27,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:12:27,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:12:27,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:12:27,188 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:12:27,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:12:27,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:12:27,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:12:27,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:12:27,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:12:27,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:12:27,193 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:12:27,193 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:12:27,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:12:27,194 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:12:27,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:12:27,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:12:27,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:12:27,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:12:27,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:12:27,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:12:27,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:12:27,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:12:27,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:12:27,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:12:27,200 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:12:27,200 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:12:27,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:12:27,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:12:27,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:12:27,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:12:27,202 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:12:27,203 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 -> b88007960cae79b63604455924d89f4d8e6ff83730f3fe3600fe1cad3b333850 [2024-10-14 07:12:27,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:12:27,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:12:27,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:12:27,555 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:12:27,556 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:12:27,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-14 07:12:29,174 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:12:29,505 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:12:29,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-14 07:12:29,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d372b7a0d/7c9120b40ddb495982fd2decb59094f1/FLAGbd1400c50 [2024-10-14 07:12:29,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d372b7a0d/7c9120b40ddb495982fd2decb59094f1 [2024-10-14 07:12:29,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:12:29,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:12:29,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:12:29,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:12:29,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:12:29,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:12:29" (1/1) ... [2024-10-14 07:12:29,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9192e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:29, skipping insertion in model container [2024-10-14 07:12:29,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:12:29" (1/1) ... [2024-10-14 07:12:29,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:12:29,860 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2024-10-14 07:12:30,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:12:30,210 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:12:30,222 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p5.c[1260,1273] [2024-10-14 07:12:30,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:12:30,386 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:12:30,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30 WrapperNode [2024-10-14 07:12:30,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:12:30,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:12:30,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:12:30,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:12:30,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,537 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1833 [2024-10-14 07:12:30,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:12:30,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:12:30,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:12:30,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:12:30,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,680 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-10-14 07:12:30,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:12:30,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:12:30,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:12:30,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:12:30,789 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (1/1) ... [2024-10-14 07:12:30,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:12:30,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:12:30,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:12:30,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:12:30,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:12:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:12:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:12:30,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:12:31,235 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:12:31,237 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:12:34,286 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-14 07:12:34,287 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:12:34,371 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:12:34,372 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:12:34,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:12:34 BoogieIcfgContainer [2024-10-14 07:12:34,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:12:34,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:12:34,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:12:34,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:12:34,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:12:29" (1/3) ... [2024-10-14 07:12:34,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6492ceb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:12:34, skipping insertion in model container [2024-10-14 07:12:34,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:30" (2/3) ... [2024-10-14 07:12:34,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6492ceb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:12:34, skipping insertion in model container [2024-10-14 07:12:34,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:12:34" (3/3) ... [2024-10-14 07:12:34,388 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p5.c [2024-10-14 07:12:34,405 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:12:34,405 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:12:34,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:12:34,474 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;@1aae61da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:12:34,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:12:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 07:12:34,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:34,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 07:12:34,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:34,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 07:12:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:12:34,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259473614] [2024-10-14 07:12:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:34,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:12:34,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:12:34,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:12:34,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:12:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:34,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 07:12:34,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:12:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:35,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:12:35,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:12:35,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259473614] [2024-10-14 07:12:35,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259473614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:35,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:35,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:12:35,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817810236] [2024-10-14 07:12:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:35,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:12:35,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:12:35,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:12:35,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:12:35,144 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:35,296 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 07:12:35,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:12:35,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-14 07:12:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:35,305 INFO L225 Difference]: With dead ends: 15 [2024-10-14 07:12:35,306 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 07:12:35,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-14 07:12:35,312 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:35,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 07:12:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 07:12:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 07:12:35,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 07:12:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:35,343 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 07:12:35,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 07:12:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 07:12:35,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:35,345 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 07:12:35,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 07:12:35,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:12:35,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:35,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 07:12:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:12:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599165859] [2024-10-14 07:12:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:35,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:12:35,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:12:35,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:12:35,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:12:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:36,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 07:12:36,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:12:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:36,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:12:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:36,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:12:36,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599165859] [2024-10-14 07:12:36,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599165859] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:12:36,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:12:36,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 07:12:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195506224] [2024-10-14 07:12:36,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:12:36,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:12:36,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:12:36,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:12:36,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:12:36,695 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:37,286 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-14 07:12:37,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:12:37,286 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 7 [2024-10-14 07:12:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:37,287 INFO L225 Difference]: With dead ends: 17 [2024-10-14 07:12:37,287 INFO L226 Difference]: Without dead ends: 15 [2024-10-14 07:12:37,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:12:37,289 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:37,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 07:12:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-14 07:12:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-14 07:12:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-10-14 07:12:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-14 07:12:37,294 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-14 07:12:37,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:37,295 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-14 07:12:37,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-14 07:12:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 07:12:37,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:37,296 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-14 07:12:37,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 07:12:37,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:12:37,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:37,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:37,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-14 07:12:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:12:37,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602944143] [2024-10-14 07:12:37,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 07:12:37,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:12:37,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:12:37,505 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:12:37,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 07:12:39,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 07:12:39,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 07:12:39,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 07:12:39,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:12:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:39,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:12:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:40,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:12:40,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602944143] [2024-10-14 07:12:40,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602944143] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:12:40,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:12:40,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-14 07:12:40,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188050392] [2024-10-14 07:12:40,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:12:40,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 07:12:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:12:40,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 07:12:40,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:12:40,691 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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-10-14 07:12:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:42,279 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-10-14 07:12:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 07:12:42,280 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 13 [2024-10-14 07:12:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:42,281 INFO L225 Difference]: With dead ends: 31 [2024-10-14 07:12:42,281 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 07:12:42,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-14 07:12:42,282 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:42,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 07:12:42,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 07:12:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-10-14 07:12:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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-10-14 07:12:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-14 07:12:42,291 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 13 [2024-10-14 07:12:42,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:42,292 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-14 07:12:42,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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-10-14 07:12:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-14 07:12:42,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 07:12:42,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:42,293 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2024-10-14 07:12:42,310 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 (4)] Ended with exit code 0 [2024-10-14 07:12:42,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:12:42,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:42,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash 181792434, now seen corresponding path program 3 times [2024-10-14 07:12:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:12:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512171877] [2024-10-14 07:12:42,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 07:12:42,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:12:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:12:42,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:12:42,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 07:12:45,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-14 07:12:45,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 07:12:45,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-14 07:12:45,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:13:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:13:06,474 INFO L311 TraceCheckSpWp]: Computing backward predicates...