./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.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 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:17:51,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:17:51,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 19:17:51,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:17:51,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:17:51,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:17:51,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:17:51,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:17:51,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:17:51,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:17:51,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:17:51,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:17:51,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:17:51,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:17:51,688 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:17:51,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:17:51,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:17:51,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:17:51,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:17:51,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:17:51,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:17:51,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:17:51,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:17:51,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:17:51,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:17:51,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:17:51,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:17:51,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:17:51,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:17:51,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:17:51,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:17:51,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:17:51,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:17:51,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:17:51,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:17:51,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:17:51,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:17:51,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:17:51,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:17:51,697 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 -> 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 [2024-11-08 19:17:51,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:17:51,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:17:51,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:17:51,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:17:51,945 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:17:51,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2024-11-08 19:17:53,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:17:53,488 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:17:53,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2024-11-08 19:17:53,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a8f8cb7/4574924cc54b44e5ad70e7ec438ad2bd/FLAGfbb0dcdb2 [2024-11-08 19:17:53,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a8f8cb7/4574924cc54b44e5ad70e7ec438ad2bd [2024-11-08 19:17:53,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:17:53,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:17:53,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:17:53,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:17:53,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:17:53,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:17:53" (1/1) ... [2024-11-08 19:17:53,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592ce10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:53, skipping insertion in model container [2024-11-08 19:17:53,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:17:53" (1/1) ... [2024-11-08 19:17:53,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:17:53,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c[1259,1272] [2024-11-08 19:17:54,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:17:54,059 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:17:54,067 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c[1259,1272] [2024-11-08 19:17:54,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:17:54,176 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:17:54,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54 WrapperNode [2024-11-08 19:17:54,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:17:54,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:17:54,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:17:54,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:17:54,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:54,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:54,549 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2752 [2024-11-08 19:17:54,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:17:54,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:17:54,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:17:54,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:17:54,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:54,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:54,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:54,728 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:17:54,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:54,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:54,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:54,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:54,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:54,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:54,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:17:54,995 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:17:54,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:17:54,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:17:54,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (1/1) ... [2024-11-08 19:17:55,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:17:55,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:17:55,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:17:55,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:17:55,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:17:55,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:17:55,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:17:55,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:17:55,351 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:17:55,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:17:57,838 INFO L? ?]: Removed 1738 outVars from TransFormulas that were not future-live. [2024-11-08 19:17:57,839 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:17:57,863 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:17:57,863 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:17:57,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:17:57 BoogieIcfgContainer [2024-11-08 19:17:57,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:17:57,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:17:57,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:17:57,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:17:57,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:17:53" (1/3) ... [2024-11-08 19:17:57,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718fc424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:17:57, skipping insertion in model container [2024-11-08 19:17:57,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:17:54" (2/3) ... [2024-11-08 19:17:57,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718fc424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:17:57, skipping insertion in model container [2024-11-08 19:17:57,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:17:57" (3/3) ... [2024-11-08 19:17:57,876 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p09.c [2024-11-08 19:17:57,893 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:17:57,893 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:17:57,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:17:57,979 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;@6febe74d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:17:57,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:17:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 723 states, 721 states have (on average 1.4993065187239945) internal successors, (1081), 722 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:17:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 19:17:58,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:17:58,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:17:58,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:17:58,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:17:58,023 INFO L85 PathProgramCache]: Analyzing trace with hash 285156242, now seen corresponding path program 1 times [2024-11-08 19:17:58,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:17:58,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93907003] [2024-11-08 19:17:58,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:17:58,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:17:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:17:59,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:17:59,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93907003] [2024-11-08 19:17:59,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93907003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:17:59,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:17:59,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:17:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764438766] [2024-11-08 19:17:59,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:17:59,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:17:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:17:59,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:17:59,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:17:59,340 INFO L87 Difference]: Start difference. First operand has 723 states, 721 states have (on average 1.4993065187239945) internal successors, (1081), 722 states have internal predecessors, (1081), 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 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:17:59,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:17:59,440 INFO L93 Difference]: Finished difference Result 1391 states and 2083 transitions. [2024-11-08 19:17:59,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:17:59,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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 141 [2024-11-08 19:17:59,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:17:59,458 INFO L225 Difference]: With dead ends: 1391 [2024-11-08 19:17:59,459 INFO L226 Difference]: Without dead ends: 722 [2024-11-08 19:17:59,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:17:59,468 INFO L432 NwaCegarLoop]: 1075 mSDtfsCounter, 0 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3219 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:17:59,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3219 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:17:59,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-11-08 19:17:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2024-11-08 19:17:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 1.4965325936199723) internal successors, (1079), 721 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:17:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1079 transitions. [2024-11-08 19:17:59,541 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1079 transitions. Word has length 141 [2024-11-08 19:17:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:17:59,542 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1079 transitions. [2024-11-08 19:17:59,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:17:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1079 transitions. [2024-11-08 19:17:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 19:17:59,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:17:59,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:17:59,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:17:59,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:17:59,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:17:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash 251604947, now seen corresponding path program 1 times [2024-11-08 19:17:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:17:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521933110] [2024-11-08 19:17:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:17:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:17:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:00,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:00,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521933110] [2024-11-08 19:18:00,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521933110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:00,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:00,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:18:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757279888] [2024-11-08 19:18:00,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:00,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:18:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:00,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:18:00,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:18:00,039 INFO L87 Difference]: Start difference. First operand 722 states and 1079 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:00,075 INFO L93 Difference]: Finished difference Result 1392 states and 2081 transitions. [2024-11-08 19:18:00,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:18:00,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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 142 [2024-11-08 19:18:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:00,081 INFO L225 Difference]: With dead ends: 1392 [2024-11-08 19:18:00,081 INFO L226 Difference]: Without dead ends: 724 [2024-11-08 19:18:00,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:18:00,085 INFO L432 NwaCegarLoop]: 1075 mSDtfsCounter, 0 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:00,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3215 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-08 19:18:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2024-11-08 19:18:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 1.4951590594744122) internal successors, (1081), 723 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1081 transitions. [2024-11-08 19:18:00,105 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1081 transitions. Word has length 142 [2024-11-08 19:18:00,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:00,106 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1081 transitions. [2024-11-08 19:18:00,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1081 transitions. [2024-11-08 19:18:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 19:18:00,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:00,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:00,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:18:00,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:00,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1888146293, now seen corresponding path program 1 times [2024-11-08 19:18:00,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:00,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727086817] [2024-11-08 19:18:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:00,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:01,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:01,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727086817] [2024-11-08 19:18:01,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727086817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:01,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:01,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:01,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324466897] [2024-11-08 19:18:01,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:01,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:01,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:01,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:01,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:01,152 INFO L87 Difference]: Start difference. First operand 724 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:01,206 INFO L93 Difference]: Finished difference Result 1402 states and 2094 transitions. [2024-11-08 19:18:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:01,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 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 143 [2024-11-08 19:18:01,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:01,209 INFO L225 Difference]: With dead ends: 1402 [2024-11-08 19:18:01,209 INFO L226 Difference]: Without dead ends: 732 [2024-11-08 19:18:01,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:01,212 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 6 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:01,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4275 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-08 19:18:01,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730. [2024-11-08 19:18:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.4938271604938271) internal successors, (1089), 729 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1089 transitions. [2024-11-08 19:18:01,226 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1089 transitions. Word has length 143 [2024-11-08 19:18:01,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:01,227 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1089 transitions. [2024-11-08 19:18:01,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1089 transitions. [2024-11-08 19:18:01,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 19:18:01,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:01,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:01,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:18:01,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:01,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:01,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1987616826, now seen corresponding path program 1 times [2024-11-08 19:18:01,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:01,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853341908] [2024-11-08 19:18:01,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:01,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:02,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:02,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853341908] [2024-11-08 19:18:02,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853341908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:02,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:02,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:18:02,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780108479] [2024-11-08 19:18:02,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:02,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:18:02,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:02,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:18:02,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:02,285 INFO L87 Difference]: Start difference. First operand 730 states and 1089 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:02,420 INFO L93 Difference]: Finished difference Result 1414 states and 2110 transitions. [2024-11-08 19:18:02,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:18:02,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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 144 [2024-11-08 19:18:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:02,423 INFO L225 Difference]: With dead ends: 1414 [2024-11-08 19:18:02,423 INFO L226 Difference]: Without dead ends: 738 [2024-11-08 19:18:02,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:18:02,427 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1001 mSDsluCounter, 3142 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 4192 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:02,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 4192 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-08 19:18:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 735. [2024-11-08 19:18:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 734 states have (on average 1.491825613079019) internal successors, (1095), 734 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1095 transitions. [2024-11-08 19:18:02,440 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1095 transitions. Word has length 144 [2024-11-08 19:18:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:02,441 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1095 transitions. [2024-11-08 19:18:02,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1095 transitions. [2024-11-08 19:18:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 19:18:02,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:02,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:02,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:18:02,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:02,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:02,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2108760781, now seen corresponding path program 1 times [2024-11-08 19:18:02,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:02,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763688162] [2024-11-08 19:18:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:02,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:03,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:03,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763688162] [2024-11-08 19:18:03,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763688162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:03,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:03,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211995120] [2024-11-08 19:18:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:03,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:03,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:03,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:03,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:03,188 INFO L87 Difference]: Start difference. First operand 735 states and 1095 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:03,241 INFO L93 Difference]: Finished difference Result 1422 states and 2119 transitions. [2024-11-08 19:18:03,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:03,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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 145 [2024-11-08 19:18:03,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:03,244 INFO L225 Difference]: With dead ends: 1422 [2024-11-08 19:18:03,244 INFO L226 Difference]: Without dead ends: 741 [2024-11-08 19:18:03,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:03,247 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 5 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:03,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4275 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-08 19:18:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2024-11-08 19:18:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.4905149051490514) internal successors, (1100), 738 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1100 transitions. [2024-11-08 19:18:03,261 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1100 transitions. Word has length 145 [2024-11-08 19:18:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:03,262 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1100 transitions. [2024-11-08 19:18:03,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1100 transitions. [2024-11-08 19:18:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 19:18:03,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:03,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:03,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:18:03,264 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:03,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash -478641492, now seen corresponding path program 1 times [2024-11-08 19:18:03,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:03,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805853917] [2024-11-08 19:18:03,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:03,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:04,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:04,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805853917] [2024-11-08 19:18:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805853917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:04,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:18:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913642842] [2024-11-08 19:18:04,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:04,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:18:04,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:04,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:18:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:04,282 INFO L87 Difference]: Start difference. First operand 739 states and 1100 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:04,442 INFO L93 Difference]: Finished difference Result 1432 states and 2132 transitions. [2024-11-08 19:18:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:18:04,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 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 145 [2024-11-08 19:18:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:04,445 INFO L225 Difference]: With dead ends: 1432 [2024-11-08 19:18:04,446 INFO L226 Difference]: Without dead ends: 747 [2024-11-08 19:18:04,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:18:04,448 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 982 mSDsluCounter, 3142 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 4192 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:04,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 4192 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-11-08 19:18:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 744. [2024-11-08 19:18:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 1.4885598923283985) internal successors, (1106), 743 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1106 transitions. [2024-11-08 19:18:04,463 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1106 transitions. Word has length 145 [2024-11-08 19:18:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:04,464 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1106 transitions. [2024-11-08 19:18:04,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1106 transitions. [2024-11-08 19:18:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 19:18:04,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:04,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:04,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:18:04,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:04,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash 653921531, now seen corresponding path program 1 times [2024-11-08 19:18:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:04,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098711169] [2024-11-08 19:18:04,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:04,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:05,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098711169] [2024-11-08 19:18:05,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098711169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:05,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:05,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:05,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386191478] [2024-11-08 19:18:05,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:05,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:05,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:05,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:05,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:05,075 INFO L87 Difference]: Start difference. First operand 744 states and 1106 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:05,129 INFO L93 Difference]: Finished difference Result 1442 states and 2144 transitions. [2024-11-08 19:18:05,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:05,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 146 [2024-11-08 19:18:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:05,132 INFO L225 Difference]: With dead ends: 1442 [2024-11-08 19:18:05,133 INFO L226 Difference]: Without dead ends: 752 [2024-11-08 19:18:05,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:05,135 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 6 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:05,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4275 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-11-08 19:18:05,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 750. [2024-11-08 19:18:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 1.4873164218958612) internal successors, (1114), 749 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1114 transitions. [2024-11-08 19:18:05,149 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1114 transitions. Word has length 146 [2024-11-08 19:18:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:05,149 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1114 transitions. [2024-11-08 19:18:05,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1114 transitions. [2024-11-08 19:18:05,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 19:18:05,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:05,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:05,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:18:05,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:05,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash 41826637, now seen corresponding path program 1 times [2024-11-08 19:18:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:05,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145162232] [2024-11-08 19:18:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:05,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:05,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:05,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145162232] [2024-11-08 19:18:05,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145162232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:05,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:05,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429569895] [2024-11-08 19:18:05,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:05,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:05,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:05,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:05,648 INFO L87 Difference]: Start difference. First operand 750 states and 1114 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:05,696 INFO L93 Difference]: Finished difference Result 1454 states and 2160 transitions. [2024-11-08 19:18:05,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:05,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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 147 [2024-11-08 19:18:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:05,699 INFO L225 Difference]: With dead ends: 1454 [2024-11-08 19:18:05,699 INFO L226 Difference]: Without dead ends: 758 [2024-11-08 19:18:05,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:05,701 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 6 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:05,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4275 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-11-08 19:18:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 756. [2024-11-08 19:18:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.486092715231788) internal successors, (1122), 755 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1122 transitions. [2024-11-08 19:18:05,714 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1122 transitions. Word has length 147 [2024-11-08 19:18:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:05,714 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1122 transitions. [2024-11-08 19:18:05,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1122 transitions. [2024-11-08 19:18:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 19:18:05,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:05,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:05,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:18:05,716 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:05,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash -534235468, now seen corresponding path program 1 times [2024-11-08 19:18:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:05,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562869201] [2024-11-08 19:18:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:05,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:06,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:06,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562869201] [2024-11-08 19:18:06,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562869201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:06,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:06,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234976819] [2024-11-08 19:18:06,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:06,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:06,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:06,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:06,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:06,414 INFO L87 Difference]: Start difference. First operand 756 states and 1122 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:06,465 INFO L93 Difference]: Finished difference Result 1670 states and 2475 transitions. [2024-11-08 19:18:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:06,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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 148 [2024-11-08 19:18:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:06,468 INFO L225 Difference]: With dead ends: 1670 [2024-11-08 19:18:06,468 INFO L226 Difference]: Without dead ends: 968 [2024-11-08 19:18:06,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:06,472 INFO L432 NwaCegarLoop]: 1073 mSDtfsCounter, 172 mSDsluCounter, 3468 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 4541 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:06,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 4541 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:06,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-11-08 19:18:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 965. [2024-11-08 19:18:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.4802904564315353) internal successors, (1427), 964 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1427 transitions. [2024-11-08 19:18:06,490 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1427 transitions. Word has length 148 [2024-11-08 19:18:06,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:06,490 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1427 transitions. [2024-11-08 19:18:06,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:06,490 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1427 transitions. [2024-11-08 19:18:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 19:18:06,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:06,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:06,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:18:06,492 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:06,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:06,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1527457361, now seen corresponding path program 1 times [2024-11-08 19:18:06,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:06,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752053864] [2024-11-08 19:18:06,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:06,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:07,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752053864] [2024-11-08 19:18:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752053864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:07,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:07,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:18:07,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192658516] [2024-11-08 19:18:07,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:07,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:18:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:07,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:18:07,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:07,233 INFO L87 Difference]: Start difference. First operand 965 states and 1427 transitions. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:07,315 INFO L93 Difference]: Finished difference Result 1884 states and 2786 transitions. [2024-11-08 19:18:07,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:18:07,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 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 149 [2024-11-08 19:18:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:07,318 INFO L225 Difference]: With dead ends: 1884 [2024-11-08 19:18:07,318 INFO L226 Difference]: Without dead ends: 973 [2024-11-08 19:18:07,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:07,320 INFO L432 NwaCegarLoop]: 1069 mSDtfsCounter, 172 mSDsluCounter, 5330 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 6399 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:07,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 6399 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2024-11-08 19:18:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 972. [2024-11-08 19:18:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.4799176107106076) internal successors, (1437), 971 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1437 transitions. [2024-11-08 19:18:07,338 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1437 transitions. Word has length 149 [2024-11-08 19:18:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:07,338 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1437 transitions. [2024-11-08 19:18:07,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1437 transitions. [2024-11-08 19:18:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 19:18:07,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:07,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:07,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 19:18:07,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:07,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash -744191574, now seen corresponding path program 1 times [2024-11-08 19:18:07,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:07,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035892983] [2024-11-08 19:18:07,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:07,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:07,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:07,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035892983] [2024-11-08 19:18:07,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035892983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:07,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:07,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:07,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954275644] [2024-11-08 19:18:07,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:07,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:07,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:07,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:07,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:07,662 INFO L87 Difference]: Start difference. First operand 972 states and 1437 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:07,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:07,707 INFO L93 Difference]: Finished difference Result 1908 states and 2821 transitions. [2024-11-08 19:18:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:07,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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 149 [2024-11-08 19:18:07,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:07,711 INFO L225 Difference]: With dead ends: 1908 [2024-11-08 19:18:07,711 INFO L226 Difference]: Without dead ends: 990 [2024-11-08 19:18:07,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:07,712 INFO L432 NwaCegarLoop]: 1074 mSDtfsCounter, 16 mSDsluCounter, 3210 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4284 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:07,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4284 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-08 19:18:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2024-11-08 19:18:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.4792719919110213) internal successors, (1463), 989 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1463 transitions. [2024-11-08 19:18:07,727 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1463 transitions. Word has length 149 [2024-11-08 19:18:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:07,727 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1463 transitions. [2024-11-08 19:18:07,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1463 transitions. [2024-11-08 19:18:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 19:18:07,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:07,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:07,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 19:18:07,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:07,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash -971648553, now seen corresponding path program 1 times [2024-11-08 19:18:07,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:07,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238430875] [2024-11-08 19:18:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:08,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:08,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238430875] [2024-11-08 19:18:08,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238430875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:08,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:08,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:08,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020636611] [2024-11-08 19:18:08,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:08,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:08,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:08,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:08,425 INFO L87 Difference]: Start difference. First operand 990 states and 1463 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:08,506 INFO L93 Difference]: Finished difference Result 1928 states and 2849 transitions. [2024-11-08 19:18:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:08,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 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 150 [2024-11-08 19:18:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:08,510 INFO L225 Difference]: With dead ends: 1928 [2024-11-08 19:18:08,511 INFO L226 Difference]: Without dead ends: 992 [2024-11-08 19:18:08,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:08,513 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 1047 mSDsluCounter, 3198 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 4269 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:08,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 4269 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-11-08 19:18:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2024-11-08 19:18:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 991 states have (on average 1.4783047426841573) internal successors, (1465), 991 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1465 transitions. [2024-11-08 19:18:08,534 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1465 transitions. Word has length 150 [2024-11-08 19:18:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:08,535 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1465 transitions. [2024-11-08 19:18:08,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1465 transitions. [2024-11-08 19:18:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 19:18:08,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:08,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:08,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 19:18:08,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1293790685, now seen corresponding path program 1 times [2024-11-08 19:18:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820141550] [2024-11-08 19:18:08,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:08,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:09,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:09,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820141550] [2024-11-08 19:18:09,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820141550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:09,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:09,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:09,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014643985] [2024-11-08 19:18:09,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:09,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:09,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:09,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:09,141 INFO L87 Difference]: Start difference. First operand 992 states and 1465 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:09,281 INFO L93 Difference]: Finished difference Result 2339 states and 3448 transitions. [2024-11-08 19:18:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:09,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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 151 [2024-11-08 19:18:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:09,286 INFO L225 Difference]: With dead ends: 2339 [2024-11-08 19:18:09,286 INFO L226 Difference]: Without dead ends: 1401 [2024-11-08 19:18:09,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:18:09,288 INFO L432 NwaCegarLoop]: 1063 mSDtfsCounter, 2133 mSDsluCounter, 3178 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:09,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 4241 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2024-11-08 19:18:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 996. [2024-11-08 19:18:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.478391959798995) internal successors, (1471), 995 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1471 transitions. [2024-11-08 19:18:09,308 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1471 transitions. Word has length 151 [2024-11-08 19:18:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:09,308 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1471 transitions. [2024-11-08 19:18:09,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1471 transitions. [2024-11-08 19:18:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 19:18:09,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:09,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:09,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 19:18:09,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:09,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:09,311 INFO L85 PathProgramCache]: Analyzing trace with hash -492666091, now seen corresponding path program 1 times [2024-11-08 19:18:09,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:09,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754514773] [2024-11-08 19:18:09,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:09,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:09,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:09,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754514773] [2024-11-08 19:18:09,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754514773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:09,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:09,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:09,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147049205] [2024-11-08 19:18:09,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:09,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:09,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:09,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:09,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:09,597 INFO L87 Difference]: Start difference. First operand 996 states and 1471 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:09,637 INFO L93 Difference]: Finished difference Result 1958 states and 2892 transitions. [2024-11-08 19:18:09,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:09,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 151 [2024-11-08 19:18:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:09,641 INFO L225 Difference]: With dead ends: 1958 [2024-11-08 19:18:09,641 INFO L226 Difference]: Without dead ends: 1016 [2024-11-08 19:18:09,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:09,642 INFO L432 NwaCegarLoop]: 1074 mSDtfsCounter, 8 mSDsluCounter, 3210 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4284 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:09,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4284 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-08 19:18:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2024-11-08 19:18:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1015 states have (on average 1.476847290640394) internal successors, (1499), 1015 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1499 transitions. [2024-11-08 19:18:09,659 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1499 transitions. Word has length 151 [2024-11-08 19:18:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:09,659 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1499 transitions. [2024-11-08 19:18:09,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1499 transitions. [2024-11-08 19:18:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 19:18:09,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:09,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:09,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 19:18:09,661 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:09,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1301691332, now seen corresponding path program 1 times [2024-11-08 19:18:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:09,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174865896] [2024-11-08 19:18:09,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:09,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:09,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:09,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174865896] [2024-11-08 19:18:09,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174865896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:09,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:09,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:09,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15697452] [2024-11-08 19:18:09,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:09,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:09,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:09,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:09,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:09,941 INFO L87 Difference]: Start difference. First operand 1016 states and 1499 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:09,980 INFO L93 Difference]: Finished difference Result 2034 states and 3000 transitions. [2024-11-08 19:18:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:09,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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 152 [2024-11-08 19:18:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:09,984 INFO L225 Difference]: With dead ends: 2034 [2024-11-08 19:18:09,984 INFO L226 Difference]: Without dead ends: 1072 [2024-11-08 19:18:09,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:09,987 INFO L432 NwaCegarLoop]: 1074 mSDtfsCounter, 19 mSDsluCounter, 3210 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4284 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:09,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4284 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-08 19:18:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2024-11-08 19:18:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.4743230625583568) internal successors, (1579), 1071 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1579 transitions. [2024-11-08 19:18:10,005 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1579 transitions. Word has length 152 [2024-11-08 19:18:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:10,005 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1579 transitions. [2024-11-08 19:18:10,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1579 transitions. [2024-11-08 19:18:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 19:18:10,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:10,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:10,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 19:18:10,008 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:10,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1633387042, now seen corresponding path program 1 times [2024-11-08 19:18:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:10,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41322455] [2024-11-08 19:18:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:10,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:10,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41322455] [2024-11-08 19:18:10,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41322455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:10,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:10,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:18:10,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397111045] [2024-11-08 19:18:10,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:10,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:18:10,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:10,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:18:10,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:18:10,891 INFO L87 Difference]: Start difference. First operand 1072 states and 1579 transitions. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:11,020 INFO L93 Difference]: Finished difference Result 2108 states and 3105 transitions. [2024-11-08 19:18:11,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:18:11,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 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 152 [2024-11-08 19:18:11,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:11,024 INFO L225 Difference]: With dead ends: 2108 [2024-11-08 19:18:11,024 INFO L226 Difference]: Without dead ends: 1090 [2024-11-08 19:18:11,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:18:11,026 INFO L432 NwaCegarLoop]: 1070 mSDtfsCounter, 1051 mSDsluCounter, 6389 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 7459 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:11,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 7459 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2024-11-08 19:18:11,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1086. [2024-11-08 19:18:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 1.4737327188940093) internal successors, (1599), 1085 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1599 transitions. [2024-11-08 19:18:11,045 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1599 transitions. Word has length 152 [2024-11-08 19:18:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:11,045 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1599 transitions. [2024-11-08 19:18:11,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1599 transitions. [2024-11-08 19:18:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 19:18:11,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:11,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:11,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 19:18:11,047 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:11,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1915322745, now seen corresponding path program 1 times [2024-11-08 19:18:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:11,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505449770] [2024-11-08 19:18:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:11,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505449770] [2024-11-08 19:18:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505449770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:11,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:11,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222975024] [2024-11-08 19:18:11,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:11,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:11,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:11,357 INFO L87 Difference]: Start difference. First operand 1086 states and 1599 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:11,393 INFO L93 Difference]: Finished difference Result 2138 states and 3148 transitions. [2024-11-08 19:18:11,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:11,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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 153 [2024-11-08 19:18:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:11,397 INFO L225 Difference]: With dead ends: 2138 [2024-11-08 19:18:11,397 INFO L226 Difference]: Without dead ends: 1106 [2024-11-08 19:18:11,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:11,399 INFO L432 NwaCegarLoop]: 1074 mSDtfsCounter, 8 mSDsluCounter, 3210 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4284 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:11,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4284 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2024-11-08 19:18:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2024-11-08 19:18:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1105 states have (on average 1.472398190045249) internal successors, (1627), 1105 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1627 transitions. [2024-11-08 19:18:11,415 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1627 transitions. Word has length 153 [2024-11-08 19:18:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:11,415 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1627 transitions. [2024-11-08 19:18:11,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1627 transitions. [2024-11-08 19:18:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 19:18:11,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:11,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:11,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 19:18:11,417 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:11,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:11,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1759097479, now seen corresponding path program 1 times [2024-11-08 19:18:11,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:11,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108560175] [2024-11-08 19:18:11,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:11,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:12,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:12,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108560175] [2024-11-08 19:18:12,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108560175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:12,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:12,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:12,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313772694] [2024-11-08 19:18:12,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:12,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:12,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:12,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:12,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:12,101 INFO L87 Difference]: Start difference. First operand 1106 states and 1627 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:12,365 INFO L93 Difference]: Finished difference Result 2622 states and 3850 transitions. [2024-11-08 19:18:12,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:12,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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 153 [2024-11-08 19:18:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:12,371 INFO L225 Difference]: With dead ends: 2622 [2024-11-08 19:18:12,371 INFO L226 Difference]: Without dead ends: 1570 [2024-11-08 19:18:12,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:18:12,373 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 1588 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 5679 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:12,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 5679 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:18:12,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-11-08 19:18:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1106. [2024-11-08 19:18:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1105 states have (on average 1.472398190045249) internal successors, (1627), 1105 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1627 transitions. [2024-11-08 19:18:12,394 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1627 transitions. Word has length 153 [2024-11-08 19:18:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:12,394 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1627 transitions. [2024-11-08 19:18:12,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1627 transitions. [2024-11-08 19:18:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 19:18:12,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:12,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:12,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 19:18:12,398 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:12,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1931351729, now seen corresponding path program 1 times [2024-11-08 19:18:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:12,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683284423] [2024-11-08 19:18:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:12,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683284423] [2024-11-08 19:18:12,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683284423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:12,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:12,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:12,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766721393] [2024-11-08 19:18:12,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:12,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:12,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:12,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:12,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:12,855 INFO L87 Difference]: Start difference. First operand 1106 states and 1627 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:12,905 INFO L93 Difference]: Finished difference Result 2212 states and 3252 transitions. [2024-11-08 19:18:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:12,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 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 154 [2024-11-08 19:18:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:12,909 INFO L225 Difference]: With dead ends: 2212 [2024-11-08 19:18:12,910 INFO L226 Difference]: Without dead ends: 1160 [2024-11-08 19:18:12,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:12,912 INFO L432 NwaCegarLoop]: 1074 mSDtfsCounter, 19 mSDsluCounter, 3210 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4284 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:12,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4284 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-11-08 19:18:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1160. [2024-11-08 19:18:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 1.4693701466781708) internal successors, (1703), 1159 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1703 transitions. [2024-11-08 19:18:12,937 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1703 transitions. Word has length 154 [2024-11-08 19:18:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:12,938 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1703 transitions. [2024-11-08 19:18:12,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1703 transitions. [2024-11-08 19:18:12,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 19:18:12,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:12,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:12,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 19:18:12,941 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:12,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1177703995, now seen corresponding path program 1 times [2024-11-08 19:18:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:12,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221204663] [2024-11-08 19:18:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:13,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:13,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221204663] [2024-11-08 19:18:13,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221204663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:13,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:13,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:13,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473294916] [2024-11-08 19:18:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:13,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:13,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:13,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:13,538 INFO L87 Difference]: Start difference. First operand 1160 states and 1703 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:13,636 INFO L93 Difference]: Finished difference Result 2701 states and 3956 transitions. [2024-11-08 19:18:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:13,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 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 154 [2024-11-08 19:18:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:13,641 INFO L225 Difference]: With dead ends: 2701 [2024-11-08 19:18:13,641 INFO L226 Difference]: Without dead ends: 1595 [2024-11-08 19:18:13,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:13,644 INFO L432 NwaCegarLoop]: 1064 mSDtfsCounter, 514 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 4168 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:13,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 4168 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2024-11-08 19:18:13,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1162. [2024-11-08 19:18:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 1.4685615848406546) internal successors, (1705), 1161 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1705 transitions. [2024-11-08 19:18:13,665 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1705 transitions. Word has length 154 [2024-11-08 19:18:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:13,665 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1705 transitions. [2024-11-08 19:18:13,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1705 transitions. [2024-11-08 19:18:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 19:18:13,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:13,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:13,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 19:18:13,667 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:13,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1593628299, now seen corresponding path program 1 times [2024-11-08 19:18:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:13,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753763752] [2024-11-08 19:18:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:13,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:13,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753763752] [2024-11-08 19:18:13,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753763752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:13,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:13,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:13,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580610506] [2024-11-08 19:18:13,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:13,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:13,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:13,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:13,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:13,957 INFO L87 Difference]: Start difference. First operand 1162 states and 1705 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:13,997 INFO L93 Difference]: Finished difference Result 2288 states and 3358 transitions. [2024-11-08 19:18:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:13,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 155 [2024-11-08 19:18:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:14,001 INFO L225 Difference]: With dead ends: 2288 [2024-11-08 19:18:14,002 INFO L226 Difference]: Without dead ends: 1182 [2024-11-08 19:18:14,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:14,004 INFO L432 NwaCegarLoop]: 1074 mSDtfsCounter, 8 mSDsluCounter, 3210 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4284 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:14,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4284 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-11-08 19:18:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2024-11-08 19:18:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.4674005080440304) internal successors, (1733), 1181 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1733 transitions. [2024-11-08 19:18:14,050 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1733 transitions. Word has length 155 [2024-11-08 19:18:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:14,050 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1733 transitions. [2024-11-08 19:18:14,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1733 transitions. [2024-11-08 19:18:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 19:18:14,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:14,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:14,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 19:18:14,052 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:14,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 800476028, now seen corresponding path program 1 times [2024-11-08 19:18:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:14,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995323628] [2024-11-08 19:18:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:14,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995323628] [2024-11-08 19:18:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995323628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:14,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:14,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467270039] [2024-11-08 19:18:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:14,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:14,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:14,332 INFO L87 Difference]: Start difference. First operand 1182 states and 1733 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:14,369 INFO L93 Difference]: Finished difference Result 2370 states and 3472 transitions. [2024-11-08 19:18:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:14,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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 156 [2024-11-08 19:18:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:14,376 INFO L225 Difference]: With dead ends: 2370 [2024-11-08 19:18:14,376 INFO L226 Difference]: Without dead ends: 1244 [2024-11-08 19:18:14,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:14,378 INFO L432 NwaCegarLoop]: 1074 mSDtfsCounter, 19 mSDsluCounter, 3210 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4284 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:14,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4284 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-11-08 19:18:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1244. [2024-11-08 19:18:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1243 states have (on average 1.4633950120675785) internal successors, (1819), 1243 states have internal predecessors, (1819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1819 transitions. [2024-11-08 19:18:14,400 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1819 transitions. Word has length 156 [2024-11-08 19:18:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:14,403 INFO L471 AbstractCegarLoop]: Abstraction has 1244 states and 1819 transitions. [2024-11-08 19:18:14,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1819 transitions. [2024-11-08 19:18:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 19:18:14,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:14,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:14,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 19:18:14,406 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:14,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1792794919, now seen corresponding path program 1 times [2024-11-08 19:18:14,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:14,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749550062] [2024-11-08 19:18:14,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:14,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:14,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:14,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749550062] [2024-11-08 19:18:14,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749550062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:14,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:14,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:14,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596664110] [2024-11-08 19:18:14,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:14,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:14,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:14,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:14,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:14,688 INFO L87 Difference]: Start difference. First operand 1244 states and 1819 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:14,730 INFO L93 Difference]: Finished difference Result 2452 states and 3586 transitions. [2024-11-08 19:18:14,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:14,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 157 [2024-11-08 19:18:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:14,734 INFO L225 Difference]: With dead ends: 2452 [2024-11-08 19:18:14,734 INFO L226 Difference]: Without dead ends: 1264 [2024-11-08 19:18:14,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:14,736 INFO L432 NwaCegarLoop]: 1074 mSDtfsCounter, 8 mSDsluCounter, 3210 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4284 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:14,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4284 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2024-11-08 19:18:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1264. [2024-11-08 19:18:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 1.4623911322248615) internal successors, (1847), 1263 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1847 transitions. [2024-11-08 19:18:14,754 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1847 transitions. Word has length 157 [2024-11-08 19:18:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:14,754 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 1847 transitions. [2024-11-08 19:18:14,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1847 transitions. [2024-11-08 19:18:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 19:18:14,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:14,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:14,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 19:18:14,756 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:14,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:14,757 INFO L85 PathProgramCache]: Analyzing trace with hash 774506417, now seen corresponding path program 1 times [2024-11-08 19:18:14,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:14,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459703290] [2024-11-08 19:18:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:14,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:15,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:15,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459703290] [2024-11-08 19:18:15,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459703290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:15,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:15,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:15,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013616546] [2024-11-08 19:18:15,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:15,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:15,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:15,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:15,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:15,035 INFO L87 Difference]: Start difference. First operand 1264 states and 1847 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:15,069 INFO L93 Difference]: Finished difference Result 2528 states and 3694 transitions. [2024-11-08 19:18:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:15,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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 158 [2024-11-08 19:18:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:15,076 INFO L225 Difference]: With dead ends: 2528 [2024-11-08 19:18:15,077 INFO L226 Difference]: Without dead ends: 1320 [2024-11-08 19:18:15,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:15,079 INFO L432 NwaCegarLoop]: 1074 mSDtfsCounter, 19 mSDsluCounter, 3210 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4284 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:15,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4284 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2024-11-08 19:18:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2024-11-08 19:18:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.4609552691432903) internal successors, (1927), 1319 states have internal predecessors, (1927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1927 transitions. [2024-11-08 19:18:15,096 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1927 transitions. Word has length 158 [2024-11-08 19:18:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:15,096 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1927 transitions. [2024-11-08 19:18:15,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1927 transitions. [2024-11-08 19:18:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 19:18:15,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:15,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:15,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 19:18:15,098 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:15,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash 701579221, now seen corresponding path program 1 times [2024-11-08 19:18:15,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:15,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023948824] [2024-11-08 19:18:15,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:15,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:15,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023948824] [2024-11-08 19:18:15,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023948824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:18:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602334235] [2024-11-08 19:18:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:15,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:18:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:18:15,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:18:15,801 INFO L87 Difference]: Start difference. First operand 1320 states and 1927 transitions. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:15,940 INFO L93 Difference]: Finished difference Result 2620 states and 3826 transitions. [2024-11-08 19:18:15,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:18:15,941 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 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 159 [2024-11-08 19:18:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:15,944 INFO L225 Difference]: With dead ends: 2620 [2024-11-08 19:18:15,944 INFO L226 Difference]: Without dead ends: 1356 [2024-11-08 19:18:15,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:18:15,946 INFO L432 NwaCegarLoop]: 1064 mSDtfsCounter, 19 mSDsluCounter, 8492 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 9556 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:15,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 9556 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2024-11-08 19:18:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1338. [2024-11-08 19:18:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 1337 states have (on average 1.4607329842931938) internal successors, (1953), 1337 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1953 transitions. [2024-11-08 19:18:15,962 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1953 transitions. Word has length 159 [2024-11-08 19:18:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:15,962 INFO L471 AbstractCegarLoop]: Abstraction has 1338 states and 1953 transitions. [2024-11-08 19:18:15,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1953 transitions. [2024-11-08 19:18:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 19:18:15,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:15,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:15,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 19:18:15,965 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:15,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:15,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1065455175, now seen corresponding path program 1 times [2024-11-08 19:18:15,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:15,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129510073] [2024-11-08 19:18:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:15,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:16,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:16,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129510073] [2024-11-08 19:18:16,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129510073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:16,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:16,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:18:16,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62023680] [2024-11-08 19:18:16,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:16,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:18:16,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:16,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:18:16,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:16,544 INFO L87 Difference]: Start difference. First operand 1338 states and 1953 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:16,691 INFO L93 Difference]: Finished difference Result 2632 states and 3842 transitions. [2024-11-08 19:18:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:16,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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 159 [2024-11-08 19:18:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:16,698 INFO L225 Difference]: With dead ends: 2632 [2024-11-08 19:18:16,698 INFO L226 Difference]: Without dead ends: 1350 [2024-11-08 19:18:16,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:18:16,701 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 1043 mSDsluCounter, 4191 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 5243 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:16,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 5243 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2024-11-08 19:18:16,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2024-11-08 19:18:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 1.4595997034840622) internal successors, (1969), 1349 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1969 transitions. [2024-11-08 19:18:16,719 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1969 transitions. Word has length 159 [2024-11-08 19:18:16,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:16,719 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1969 transitions. [2024-11-08 19:18:16,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1969 transitions. [2024-11-08 19:18:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 19:18:16,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:16,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:16,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 19:18:16,721 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:16,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash -123801458, now seen corresponding path program 1 times [2024-11-08 19:18:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621318584] [2024-11-08 19:18:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:17,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:17,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621318584] [2024-11-08 19:18:17,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621318584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:17,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:17,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149992120] [2024-11-08 19:18:17,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:17,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:17,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:17,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:17,115 INFO L87 Difference]: Start difference. First operand 1350 states and 1969 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:17,169 INFO L93 Difference]: Finished difference Result 2652 states and 3870 transitions. [2024-11-08 19:18:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:17,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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 160 [2024-11-08 19:18:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:17,176 INFO L225 Difference]: With dead ends: 2652 [2024-11-08 19:18:17,176 INFO L226 Difference]: Without dead ends: 1358 [2024-11-08 19:18:17,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:17,178 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 1 mSDsluCounter, 4268 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5339 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:17,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5339 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2024-11-08 19:18:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1342. [2024-11-08 19:18:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1341 states have (on average 1.4578672632363907) internal successors, (1955), 1341 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1955 transitions. [2024-11-08 19:18:17,199 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1955 transitions. Word has length 160 [2024-11-08 19:18:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:17,199 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1955 transitions. [2024-11-08 19:18:17,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1955 transitions. [2024-11-08 19:18:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 19:18:17,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:17,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:17,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 19:18:17,202 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:17,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1110573898, now seen corresponding path program 1 times [2024-11-08 19:18:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:17,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718532648] [2024-11-08 19:18:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:17,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718532648] [2024-11-08 19:18:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718532648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:18:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901020747] [2024-11-08 19:18:17,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:17,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:18:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:18:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:17,892 INFO L87 Difference]: Start difference. First operand 1342 states and 1955 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:17,950 INFO L93 Difference]: Finished difference Result 2648 states and 3858 transitions. [2024-11-08 19:18:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:17,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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 160 [2024-11-08 19:18:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:17,953 INFO L225 Difference]: With dead ends: 2648 [2024-11-08 19:18:17,953 INFO L226 Difference]: Without dead ends: 1362 [2024-11-08 19:18:17,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:17,954 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 1 mSDsluCounter, 5333 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6404 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:17,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6404 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2024-11-08 19:18:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1354. [2024-11-08 19:18:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1353 states have (on average 1.4567627494456763) internal successors, (1971), 1353 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1971 transitions. [2024-11-08 19:18:17,974 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1971 transitions. Word has length 160 [2024-11-08 19:18:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:17,974 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1971 transitions. [2024-11-08 19:18:17,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1971 transitions. [2024-11-08 19:18:17,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 19:18:17,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:17,976 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:17,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 19:18:17,977 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:17,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash -262027691, now seen corresponding path program 1 times [2024-11-08 19:18:17,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:17,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860634413] [2024-11-08 19:18:17,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:17,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:19,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:19,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860634413] [2024-11-08 19:18:19,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860634413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:19,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:19,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2024-11-08 19:18:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070692875] [2024-11-08 19:18:19,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:19,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 19:18:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:19,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 19:18:19,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 19:18:19,796 INFO L87 Difference]: Start difference. First operand 1354 states and 1971 transitions. Second operand has 35 states, 35 states have (on average 4.6) internal successors, (161), 35 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:20,942 INFO L93 Difference]: Finished difference Result 3048 states and 4436 transitions. [2024-11-08 19:18:20,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-08 19:18:20,944 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.6) internal successors, (161), 35 states have internal predecessors, (161), 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 161 [2024-11-08 19:18:20,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:20,947 INFO L225 Difference]: With dead ends: 3048 [2024-11-08 19:18:20,947 INFO L226 Difference]: Without dead ends: 1750 [2024-11-08 19:18:20,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1187, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 19:18:20,949 INFO L432 NwaCegarLoop]: 1190 mSDtfsCounter, 134 mSDsluCounter, 36632 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 37822 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:20,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 37822 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 19:18:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2024-11-08 19:18:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1708. [2024-11-08 19:18:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1707 states have (on average 1.4616285881663738) internal successors, (2495), 1707 states have internal predecessors, (2495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2495 transitions. [2024-11-08 19:18:20,969 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2495 transitions. Word has length 161 [2024-11-08 19:18:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:20,969 INFO L471 AbstractCegarLoop]: Abstraction has 1708 states and 2495 transitions. [2024-11-08 19:18:20,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.6) internal successors, (161), 35 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2495 transitions. [2024-11-08 19:18:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 19:18:20,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:20,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:20,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 19:18:20,972 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:20,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1457254959, now seen corresponding path program 1 times [2024-11-08 19:18:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83510811] [2024-11-08 19:18:20,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:20,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83510811] [2024-11-08 19:18:21,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83510811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:21,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:21,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488865403] [2024-11-08 19:18:21,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:21,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:21,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:21,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:21,334 INFO L87 Difference]: Start difference. First operand 1708 states and 2495 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:21,379 INFO L93 Difference]: Finished difference Result 3390 states and 4954 transitions. [2024-11-08 19:18:21,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 162 [2024-11-08 19:18:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:21,382 INFO L225 Difference]: With dead ends: 3390 [2024-11-08 19:18:21,382 INFO L226 Difference]: Without dead ends: 1738 [2024-11-08 19:18:21,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:21,384 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 1 mSDsluCounter, 4268 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5339 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:21,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5339 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2024-11-08 19:18:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1726. [2024-11-08 19:18:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1725 states have (on average 1.4602898550724637) internal successors, (2519), 1725 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2519 transitions. [2024-11-08 19:18:21,400 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2519 transitions. Word has length 162 [2024-11-08 19:18:21,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:21,400 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2519 transitions. [2024-11-08 19:18:21,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:21,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2519 transitions. [2024-11-08 19:18:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 19:18:21,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:21,403 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:21,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 19:18:21,403 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:21,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1601108839, now seen corresponding path program 1 times [2024-11-08 19:18:21,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:21,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082570903] [2024-11-08 19:18:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:21,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:22,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:22,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082570903] [2024-11-08 19:18:22,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082570903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:22,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:22,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:18:22,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098349368] [2024-11-08 19:18:22,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:22,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:18:22,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:22,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:18:22,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:18:22,279 INFO L87 Difference]: Start difference. First operand 1726 states and 2519 transitions. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:22,401 INFO L93 Difference]: Finished difference Result 3476 states and 5068 transitions. [2024-11-08 19:18:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:18:22,402 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 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 163 [2024-11-08 19:18:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:22,405 INFO L225 Difference]: With dead ends: 3476 [2024-11-08 19:18:22,405 INFO L226 Difference]: Without dead ends: 1806 [2024-11-08 19:18:22,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:18:22,407 INFO L432 NwaCegarLoop]: 1068 mSDtfsCounter, 32 mSDsluCounter, 9580 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 10648 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:22,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 10648 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2024-11-08 19:18:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1772. [2024-11-08 19:18:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1771 states have (on average 1.458498023715415) internal successors, (2583), 1771 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2583 transitions. [2024-11-08 19:18:22,426 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2583 transitions. Word has length 163 [2024-11-08 19:18:22,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:22,426 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2583 transitions. [2024-11-08 19:18:22,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2583 transitions. [2024-11-08 19:18:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 19:18:22,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:22,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:22,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 19:18:22,428 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:22,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:22,428 INFO L85 PathProgramCache]: Analyzing trace with hash -997336949, now seen corresponding path program 1 times [2024-11-08 19:18:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:22,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217563166] [2024-11-08 19:18:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:22,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217563166] [2024-11-08 19:18:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217563166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:22,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264464619] [2024-11-08 19:18:22,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:22,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:22,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:22,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:22,967 INFO L87 Difference]: Start difference. First operand 1772 states and 2583 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:23,067 INFO L93 Difference]: Finished difference Result 3536 states and 5156 transitions. [2024-11-08 19:18:23,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:23,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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 163 [2024-11-08 19:18:23,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:23,070 INFO L225 Difference]: With dead ends: 3536 [2024-11-08 19:18:23,070 INFO L226 Difference]: Without dead ends: 1820 [2024-11-08 19:18:23,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:18:23,074 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 1001 mSDsluCounter, 3144 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 4196 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:23,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 4196 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2024-11-08 19:18:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1820. [2024-11-08 19:18:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1819 states have (on average 1.4551951621770203) internal successors, (2647), 1819 states have internal predecessors, (2647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2647 transitions. [2024-11-08 19:18:23,096 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2647 transitions. Word has length 163 [2024-11-08 19:18:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:23,096 INFO L471 AbstractCegarLoop]: Abstraction has 1820 states and 2647 transitions. [2024-11-08 19:18:23,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2647 transitions. [2024-11-08 19:18:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 19:18:23,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:23,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:23,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 19:18:23,099 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:23,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash 275664555, now seen corresponding path program 1 times [2024-11-08 19:18:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:23,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250963505] [2024-11-08 19:18:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:23,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:23,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250963505] [2024-11-08 19:18:23,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250963505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:23,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:23,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:18:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578545596] [2024-11-08 19:18:23,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:23,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:18:23,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:18:23,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:23,731 INFO L87 Difference]: Start difference. First operand 1820 states and 2647 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:23,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:23,852 INFO L93 Difference]: Finished difference Result 3722 states and 5412 transitions. [2024-11-08 19:18:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:23,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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 163 [2024-11-08 19:18:23,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:23,855 INFO L225 Difference]: With dead ends: 3722 [2024-11-08 19:18:23,855 INFO L226 Difference]: Without dead ends: 1958 [2024-11-08 19:18:23,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:18:23,858 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 975 mSDsluCounter, 4185 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 5237 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:23,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 5237 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2024-11-08 19:18:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1958. [2024-11-08 19:18:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1957 states have (on average 1.451711803781298) internal successors, (2841), 1957 states have internal predecessors, (2841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2841 transitions. [2024-11-08 19:18:23,880 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2841 transitions. Word has length 163 [2024-11-08 19:18:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:23,881 INFO L471 AbstractCegarLoop]: Abstraction has 1958 states and 2841 transitions. [2024-11-08 19:18:23,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2841 transitions. [2024-11-08 19:18:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 19:18:23,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:23,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:23,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 19:18:23,883 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:23,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2003656042, now seen corresponding path program 1 times [2024-11-08 19:18:23,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:23,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768127586] [2024-11-08 19:18:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:23,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:24,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:24,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768127586] [2024-11-08 19:18:24,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768127586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:24,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:24,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:18:24,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055906661] [2024-11-08 19:18:24,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:24,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:18:24,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:24,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:18:24,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:18:24,512 INFO L87 Difference]: Start difference. First operand 1958 states and 2841 transitions. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:24,642 INFO L93 Difference]: Finished difference Result 3870 states and 5614 transitions. [2024-11-08 19:18:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:18:24,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 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 163 [2024-11-08 19:18:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:24,645 INFO L225 Difference]: With dead ends: 3870 [2024-11-08 19:18:24,646 INFO L226 Difference]: Without dead ends: 1968 [2024-11-08 19:18:24,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:18:24,648 INFO L432 NwaCegarLoop]: 1063 mSDtfsCounter, 12 mSDsluCounter, 9539 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10602 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:24,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10602 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:24,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-11-08 19:18:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1964. [2024-11-08 19:18:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1963 states have (on average 1.4513499745287826) internal successors, (2849), 1963 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2849 transitions. [2024-11-08 19:18:24,666 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2849 transitions. Word has length 163 [2024-11-08 19:18:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:24,667 INFO L471 AbstractCegarLoop]: Abstraction has 1964 states and 2849 transitions. [2024-11-08 19:18:24,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2849 transitions. [2024-11-08 19:18:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 19:18:24,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:24,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:24,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 19:18:24,669 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:24,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1829302468, now seen corresponding path program 1 times [2024-11-08 19:18:24,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:24,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301414083] [2024-11-08 19:18:24,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:25,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:25,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301414083] [2024-11-08 19:18:25,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301414083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:25,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:25,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 19:18:25,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705171027] [2024-11-08 19:18:25,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:25,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 19:18:25,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:25,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 19:18:25,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-11-08 19:18:25,746 INFO L87 Difference]: Start difference. First operand 1964 states and 2849 transitions. Second operand has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 21 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:26,071 INFO L93 Difference]: Finished difference Result 4176 states and 6054 transitions. [2024-11-08 19:18:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 19:18:26,072 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 21 states have internal predecessors, (163), 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 163 [2024-11-08 19:18:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:26,075 INFO L225 Difference]: With dead ends: 4176 [2024-11-08 19:18:26,075 INFO L226 Difference]: Without dead ends: 2268 [2024-11-08 19:18:26,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-11-08 19:18:26,077 INFO L432 NwaCegarLoop]: 1100 mSDtfsCounter, 71 mSDsluCounter, 16453 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 17553 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:26,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 17553 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:18:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2024-11-08 19:18:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2228. [2024-11-08 19:18:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2227 states have (on average 1.4535249214189492) internal successors, (3237), 2227 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 3237 transitions. [2024-11-08 19:18:26,097 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 3237 transitions. Word has length 163 [2024-11-08 19:18:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:26,097 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 3237 transitions. [2024-11-08 19:18:26,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 21 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 3237 transitions. [2024-11-08 19:18:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 19:18:26,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:26,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:26,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 19:18:26,099 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:26,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:26,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1517825195, now seen corresponding path program 1 times [2024-11-08 19:18:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:26,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106769489] [2024-11-08 19:18:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:26,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:26,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:26,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106769489] [2024-11-08 19:18:26,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106769489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:26,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:26,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:26,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385186496] [2024-11-08 19:18:26,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:26,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:26,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:26,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:26,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:26,585 INFO L87 Difference]: Start difference. First operand 2228 states and 3237 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:26,694 INFO L93 Difference]: Finished difference Result 4586 states and 6642 transitions. [2024-11-08 19:18:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:26,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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 163 [2024-11-08 19:18:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:26,699 INFO L225 Difference]: With dead ends: 4586 [2024-11-08 19:18:26,699 INFO L226 Difference]: Without dead ends: 2414 [2024-11-08 19:18:26,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:26,702 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 1004 mSDsluCounter, 3139 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 4191 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:26,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 4191 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:26,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2024-11-08 19:18:26,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2370. [2024-11-08 19:18:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2369 states have (on average 1.4432249894470242) internal successors, (3419), 2369 states have internal predecessors, (3419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3419 transitions. [2024-11-08 19:18:26,729 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3419 transitions. Word has length 163 [2024-11-08 19:18:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:26,730 INFO L471 AbstractCegarLoop]: Abstraction has 2370 states and 3419 transitions. [2024-11-08 19:18:26,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3419 transitions. [2024-11-08 19:18:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 19:18:26,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:26,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:26,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-08 19:18:26,732 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:26,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1445364142, now seen corresponding path program 1 times [2024-11-08 19:18:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:26,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732954700] [2024-11-08 19:18:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:26,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:27,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732954700] [2024-11-08 19:18:27,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732954700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:27,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:27,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:27,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116961514] [2024-11-08 19:18:27,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:27,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:27,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:27,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:27,203 INFO L87 Difference]: Start difference. First operand 2370 states and 3419 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:27,282 INFO L93 Difference]: Finished difference Result 4696 states and 6774 transitions. [2024-11-08 19:18:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:27,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 163 [2024-11-08 19:18:27,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:27,286 INFO L225 Difference]: With dead ends: 4696 [2024-11-08 19:18:27,286 INFO L226 Difference]: Without dead ends: 2382 [2024-11-08 19:18:27,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-08 19:18:27,290 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 1011 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:27,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 3147 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2024-11-08 19:18:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 2382. [2024-11-08 19:18:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2381 states have (on average 1.4409911801763964) internal successors, (3431), 2381 states have internal predecessors, (3431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3431 transitions. [2024-11-08 19:18:27,313 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3431 transitions. Word has length 163 [2024-11-08 19:18:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:27,313 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 3431 transitions. [2024-11-08 19:18:27,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3431 transitions. [2024-11-08 19:18:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 19:18:27,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:27,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:27,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 19:18:27,315 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:27,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1137700413, now seen corresponding path program 1 times [2024-11-08 19:18:27,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:27,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053183370] [2024-11-08 19:18:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:27,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:27,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:27,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053183370] [2024-11-08 19:18:27,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053183370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:27,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:27,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:18:27,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432818529] [2024-11-08 19:18:27,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:27,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:18:27,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:27,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:18:27,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:27,800 INFO L87 Difference]: Start difference. First operand 2382 states and 3431 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:27,903 INFO L93 Difference]: Finished difference Result 4758 states and 6852 transitions. [2024-11-08 19:18:27,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:27,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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 163 [2024-11-08 19:18:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:27,907 INFO L225 Difference]: With dead ends: 4758 [2024-11-08 19:18:27,907 INFO L226 Difference]: Without dead ends: 2432 [2024-11-08 19:18:27,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:18:27,910 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 1053 mSDsluCounter, 4185 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 5237 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:27,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 5237 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2024-11-08 19:18:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2432. [2024-11-08 19:18:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2431 states have (on average 1.439325380501851) internal successors, (3499), 2431 states have internal predecessors, (3499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3499 transitions. [2024-11-08 19:18:27,942 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3499 transitions. Word has length 163 [2024-11-08 19:18:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:27,942 INFO L471 AbstractCegarLoop]: Abstraction has 2432 states and 3499 transitions. [2024-11-08 19:18:27,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3499 transitions. [2024-11-08 19:18:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 19:18:27,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:27,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:27,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 19:18:27,944 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:27,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:27,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1123341428, now seen corresponding path program 1 times [2024-11-08 19:18:27,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:27,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036833213] [2024-11-08 19:18:27,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:27,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:28,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:28,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036833213] [2024-11-08 19:18:28,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036833213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:28,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:28,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:18:28,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291688856] [2024-11-08 19:18:28,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:28,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:18:28,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:28,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:18:28,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:28,452 INFO L87 Difference]: Start difference. First operand 2432 states and 3499 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:28,571 INFO L93 Difference]: Finished difference Result 4856 states and 6982 transitions. [2024-11-08 19:18:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:28,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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 164 [2024-11-08 19:18:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:28,575 INFO L225 Difference]: With dead ends: 4856 [2024-11-08 19:18:28,575 INFO L226 Difference]: Without dead ends: 2480 [2024-11-08 19:18:28,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:18:28,578 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 1022 mSDsluCounter, 4190 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 5242 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:28,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 5242 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2024-11-08 19:18:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2456. [2024-11-08 19:18:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 2455 states have (on average 1.439918533604888) internal successors, (3535), 2455 states have internal predecessors, (3535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3535 transitions. [2024-11-08 19:18:28,600 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 3535 transitions. Word has length 164 [2024-11-08 19:18:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:28,600 INFO L471 AbstractCegarLoop]: Abstraction has 2456 states and 3535 transitions. [2024-11-08 19:18:28,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3535 transitions. [2024-11-08 19:18:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 19:18:28,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:28,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:28,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-08 19:18:28,602 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:28,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2146188007, now seen corresponding path program 1 times [2024-11-08 19:18:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:28,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670864803] [2024-11-08 19:18:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:29,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:29,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670864803] [2024-11-08 19:18:29,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670864803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:29,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:29,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-11-08 19:18:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252565437] [2024-11-08 19:18:29,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:29,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 19:18:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:29,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 19:18:29,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2024-11-08 19:18:29,762 INFO L87 Difference]: Start difference. First operand 2456 states and 3535 transitions. Second operand has 25 states, 25 states have (on average 6.56) internal successors, (164), 25 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:30,351 INFO L93 Difference]: Finished difference Result 5458 states and 7838 transitions. [2024-11-08 19:18:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 19:18:30,352 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.56) internal successors, (164), 25 states have internal predecessors, (164), 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 164 [2024-11-08 19:18:30,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:30,356 INFO L225 Difference]: With dead ends: 5458 [2024-11-08 19:18:30,356 INFO L226 Difference]: Without dead ends: 3058 [2024-11-08 19:18:30,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2024-11-08 19:18:30,359 INFO L432 NwaCegarLoop]: 1028 mSDtfsCounter, 102 mSDsluCounter, 22592 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 23620 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:30,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 23620 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 19:18:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2024-11-08 19:18:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 3008. [2024-11-08 19:18:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4356501496508147) internal successors, (4317), 3007 states have internal predecessors, (4317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4317 transitions. [2024-11-08 19:18:30,386 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4317 transitions. Word has length 164 [2024-11-08 19:18:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:30,387 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4317 transitions. [2024-11-08 19:18:30,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.56) internal successors, (164), 25 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4317 transitions. [2024-11-08 19:18:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 19:18:30,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:30,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:30,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-08 19:18:30,389 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:30,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:30,389 INFO L85 PathProgramCache]: Analyzing trace with hash 61157056, now seen corresponding path program 1 times [2024-11-08 19:18:30,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:30,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775884965] [2024-11-08 19:18:30,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:30,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775884965] [2024-11-08 19:18:30,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775884965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:30,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:30,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:30,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937430271] [2024-11-08 19:18:30,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:30,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:30,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:30,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:30,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:30,893 INFO L87 Difference]: Start difference. First operand 3008 states and 4317 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:30,934 INFO L93 Difference]: Finished difference Result 5996 states and 8606 transitions. [2024-11-08 19:18:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:30,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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 164 [2024-11-08 19:18:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:30,938 INFO L225 Difference]: With dead ends: 5996 [2024-11-08 19:18:30,939 INFO L226 Difference]: Without dead ends: 3044 [2024-11-08 19:18:30,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:30,942 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 5 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:30,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4275 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2024-11-08 19:18:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3032. [2024-11-08 19:18:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 3031 states have (on average 1.4335202903332234) internal successors, (4345), 3031 states have internal predecessors, (4345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 4345 transitions. [2024-11-08 19:18:30,967 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 4345 transitions. Word has length 164 [2024-11-08 19:18:30,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:30,968 INFO L471 AbstractCegarLoop]: Abstraction has 3032 states and 4345 transitions. [2024-11-08 19:18:30,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 4345 transitions. [2024-11-08 19:18:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 19:18:30,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:30,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:30,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-08 19:18:30,970 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:30,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2096140377, now seen corresponding path program 1 times [2024-11-08 19:18:30,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:30,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334978148] [2024-11-08 19:18:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:30,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334978148] [2024-11-08 19:18:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334978148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:31,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600957128] [2024-11-08 19:18:31,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:31,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:31,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:31,457 INFO L87 Difference]: Start difference. First operand 3032 states and 4345 transitions. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:31,552 INFO L93 Difference]: Finished difference Result 6024 states and 8632 transitions. [2024-11-08 19:18:31,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:31,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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 164 [2024-11-08 19:18:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:31,557 INFO L225 Difference]: With dead ends: 6024 [2024-11-08 19:18:31,557 INFO L226 Difference]: Without dead ends: 3048 [2024-11-08 19:18:31,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:31,561 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 966 mSDsluCounter, 3140 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 4192 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:31,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 4192 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2024-11-08 19:18:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 3048. [2024-11-08 19:18:31,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 3047 states have (on average 1.4312438464063013) internal successors, (4361), 3047 states have internal predecessors, (4361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 4361 transitions. [2024-11-08 19:18:31,589 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 4361 transitions. Word has length 164 [2024-11-08 19:18:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:31,590 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 4361 transitions. [2024-11-08 19:18:31,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4361 transitions. [2024-11-08 19:18:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 19:18:31,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:31,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:31,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-08 19:18:31,592 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:31,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:31,593 INFO L85 PathProgramCache]: Analyzing trace with hash -633210311, now seen corresponding path program 1 times [2024-11-08 19:18:31,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:31,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665868429] [2024-11-08 19:18:31,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:31,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:32,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:32,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665868429] [2024-11-08 19:18:32,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665868429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:32,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:32,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 19:18:32,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344177805] [2024-11-08 19:18:32,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:32,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:18:32,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:32,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:18:32,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:18:32,361 INFO L87 Difference]: Start difference. First operand 3048 states and 4361 transitions. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:32,512 INFO L93 Difference]: Finished difference Result 6056 states and 8660 transitions. [2024-11-08 19:18:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:18:32,513 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 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 164 [2024-11-08 19:18:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:32,518 INFO L225 Difference]: With dead ends: 6056 [2024-11-08 19:18:32,518 INFO L226 Difference]: Without dead ends: 3064 [2024-11-08 19:18:32,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:18:32,522 INFO L432 NwaCegarLoop]: 1058 mSDtfsCounter, 10 mSDsluCounter, 10549 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11607 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:32,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 11607 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:32,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2024-11-08 19:18:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 3054. [2024-11-08 19:18:32,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3054 states, 3053 states have (on average 1.431051424828038) internal successors, (4369), 3053 states have internal predecessors, (4369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 4369 transitions. [2024-11-08 19:18:32,553 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 4369 transitions. Word has length 164 [2024-11-08 19:18:32,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:32,553 INFO L471 AbstractCegarLoop]: Abstraction has 3054 states and 4369 transitions. [2024-11-08 19:18:32,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 4369 transitions. [2024-11-08 19:18:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 19:18:32,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:32,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:32,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-08 19:18:32,556 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:32,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash 870460000, now seen corresponding path program 1 times [2024-11-08 19:18:32,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:32,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129847538] [2024-11-08 19:18:32,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:32,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:33,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:33,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129847538] [2024-11-08 19:18:33,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129847538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:33,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:33,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 19:18:33,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990306761] [2024-11-08 19:18:33,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:33,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 19:18:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:33,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 19:18:33,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:18:33,471 INFO L87 Difference]: Start difference. First operand 3054 states and 4369 transitions. Second operand has 19 states, 19 states have (on average 8.68421052631579) internal successors, (165), 19 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:33,788 INFO L93 Difference]: Finished difference Result 6104 states and 8730 transitions. [2024-11-08 19:18:33,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 19:18:33,788 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.68421052631579) internal successors, (165), 19 states have internal predecessors, (165), 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 165 [2024-11-08 19:18:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:33,791 INFO L225 Difference]: With dead ends: 6104 [2024-11-08 19:18:33,791 INFO L226 Difference]: Without dead ends: 3106 [2024-11-08 19:18:33,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2024-11-08 19:18:33,794 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 74 mSDsluCounter, 17689 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 18732 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:33,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 18732 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:18:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2024-11-08 19:18:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 2974. [2024-11-08 19:18:33,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2974 states, 2973 states have (on average 1.4352505886310125) internal successors, (4267), 2973 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4267 transitions. [2024-11-08 19:18:33,818 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4267 transitions. Word has length 165 [2024-11-08 19:18:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:33,818 INFO L471 AbstractCegarLoop]: Abstraction has 2974 states and 4267 transitions. [2024-11-08 19:18:33,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.68421052631579) internal successors, (165), 19 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4267 transitions. [2024-11-08 19:18:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 19:18:33,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:33,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:33,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-08 19:18:33,821 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:33,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:33,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1234338407, now seen corresponding path program 1 times [2024-11-08 19:18:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:33,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599928351] [2024-11-08 19:18:33,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:33,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:34,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:34,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599928351] [2024-11-08 19:18:34,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599928351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:34,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:34,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:18:34,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416031623] [2024-11-08 19:18:34,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:34,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:18:34,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:34,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:18:34,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:18:34,425 INFO L87 Difference]: Start difference. First operand 2974 states and 4267 transitions. Second operand has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:34,508 INFO L93 Difference]: Finished difference Result 6056 states and 8686 transitions. [2024-11-08 19:18:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:18:34,510 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 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 165 [2024-11-08 19:18:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:34,514 INFO L225 Difference]: With dead ends: 6056 [2024-11-08 19:18:34,514 INFO L226 Difference]: Without dead ends: 3138 [2024-11-08 19:18:34,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:18:34,517 INFO L432 NwaCegarLoop]: 1065 mSDtfsCounter, 36 mSDsluCounter, 6442 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 7507 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:34,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 7507 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2024-11-08 19:18:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 3078. [2024-11-08 19:18:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 3077 states have (on average 1.4348391290217744) internal successors, (4415), 3077 states have internal predecessors, (4415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4415 transitions. [2024-11-08 19:18:34,546 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4415 transitions. Word has length 165 [2024-11-08 19:18:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:34,546 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4415 transitions. [2024-11-08 19:18:34,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4415 transitions. [2024-11-08 19:18:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 19:18:34,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:34,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:34,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-08 19:18:34,548 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:34,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1749783296, now seen corresponding path program 1 times [2024-11-08 19:18:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:34,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066056834] [2024-11-08 19:18:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:35,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:35,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066056834] [2024-11-08 19:18:35,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066056834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:35,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:35,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 19:18:35,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214463660] [2024-11-08 19:18:35,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:35,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:18:35,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:35,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:18:35,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:18:35,602 INFO L87 Difference]: Start difference. First operand 3078 states and 4415 transitions. Second operand has 12 states, 12 states have (on average 13.75) internal successors, (165), 12 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:35,760 INFO L93 Difference]: Finished difference Result 6138 states and 8800 transitions. [2024-11-08 19:18:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 19:18:35,760 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.75) internal successors, (165), 12 states have internal predecessors, (165), 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 165 [2024-11-08 19:18:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:35,763 INFO L225 Difference]: With dead ends: 6138 [2024-11-08 19:18:35,763 INFO L226 Difference]: Without dead ends: 3116 [2024-11-08 19:18:35,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:18:35,766 INFO L432 NwaCegarLoop]: 1062 mSDtfsCounter, 12 mSDsluCounter, 10587 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 11649 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:35,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 11649 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2024-11-08 19:18:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3096. [2024-11-08 19:18:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 3095 states have (on average 1.4348949919224556) internal successors, (4441), 3095 states have internal predecessors, (4441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 4441 transitions. [2024-11-08 19:18:35,789 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 4441 transitions. Word has length 165 [2024-11-08 19:18:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:35,790 INFO L471 AbstractCegarLoop]: Abstraction has 3096 states and 4441 transitions. [2024-11-08 19:18:35,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.75) internal successors, (165), 12 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 4441 transitions. [2024-11-08 19:18:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 19:18:35,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:35,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:35,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-08 19:18:35,793 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:35,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash 124514318, now seen corresponding path program 1 times [2024-11-08 19:18:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:35,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43044833] [2024-11-08 19:18:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:35,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:36,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:36,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43044833] [2024-11-08 19:18:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43044833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:36,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:36,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302295375] [2024-11-08 19:18:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:36,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:36,172 INFO L87 Difference]: Start difference. First operand 3096 states and 4441 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:36,687 INFO L93 Difference]: Finished difference Result 7479 states and 10709 transitions. [2024-11-08 19:18:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:36,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 165 [2024-11-08 19:18:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:36,692 INFO L225 Difference]: With dead ends: 7479 [2024-11-08 19:18:36,693 INFO L226 Difference]: Without dead ends: 4439 [2024-11-08 19:18:36,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-08 19:18:36,698 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 1784 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:36,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1784 Valid, 2422 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 19:18:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4439 states. [2024-11-08 19:18:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4439 to 3137. [2024-11-08 19:18:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3137 states, 3136 states have (on average 1.4346301020408163) internal successors, (4499), 3136 states have internal predecessors, (4499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 4499 transitions. [2024-11-08 19:18:36,732 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 4499 transitions. Word has length 165 [2024-11-08 19:18:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:36,732 INFO L471 AbstractCegarLoop]: Abstraction has 3137 states and 4499 transitions. [2024-11-08 19:18:36,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 4499 transitions. [2024-11-08 19:18:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 19:18:36,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:36,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:36,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-08 19:18:36,736 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:36,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash -134884395, now seen corresponding path program 1 times [2024-11-08 19:18:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83911480] [2024-11-08 19:18:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:37,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:37,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83911480] [2024-11-08 19:18:37,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83911480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:37,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:37,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:37,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278638195] [2024-11-08 19:18:37,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:37,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:37,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:37,196 INFO L87 Difference]: Start difference. First operand 3137 states and 4499 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:37,275 INFO L93 Difference]: Finished difference Result 6153 states and 8824 transitions. [2024-11-08 19:18:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:37,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 165 [2024-11-08 19:18:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:37,278 INFO L225 Difference]: With dead ends: 6153 [2024-11-08 19:18:37,278 INFO L226 Difference]: Without dead ends: 3113 [2024-11-08 19:18:37,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-08 19:18:37,281 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 1030 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:37,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 3146 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2024-11-08 19:18:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 3109. [2024-11-08 19:18:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3109 states, 3108 states have (on average 1.4346846846846846) internal successors, (4459), 3108 states have internal predecessors, (4459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 4459 transitions. [2024-11-08 19:18:37,305 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 4459 transitions. Word has length 165 [2024-11-08 19:18:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:37,306 INFO L471 AbstractCegarLoop]: Abstraction has 3109 states and 4459 transitions. [2024-11-08 19:18:37,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 4459 transitions. [2024-11-08 19:18:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 19:18:37,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:37,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:37,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-08 19:18:37,308 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:37,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1585709390, now seen corresponding path program 1 times [2024-11-08 19:18:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:37,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854786174] [2024-11-08 19:18:37,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:37,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:37,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854786174] [2024-11-08 19:18:37,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854786174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:37,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:37,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:18:37,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123957968] [2024-11-08 19:18:37,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:37,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:18:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:37,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:18:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:18:37,754 INFO L87 Difference]: Start difference. First operand 3109 states and 4459 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:37,824 INFO L93 Difference]: Finished difference Result 6151 states and 8824 transitions. [2024-11-08 19:18:37,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:18:37,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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 166 [2024-11-08 19:18:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:37,827 INFO L225 Difference]: With dead ends: 6151 [2024-11-08 19:18:37,827 INFO L226 Difference]: Without dead ends: 3139 [2024-11-08 19:18:37,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:18:37,831 INFO L432 NwaCegarLoop]: 1068 mSDtfsCounter, 20 mSDsluCounter, 7449 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8517 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:37,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8517 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:37,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2024-11-08 19:18:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 3127. [2024-11-08 19:18:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 3126 states have (on average 1.4341010876519513) internal successors, (4483), 3126 states have internal predecessors, (4483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 4483 transitions. [2024-11-08 19:18:37,858 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 4483 transitions. Word has length 166 [2024-11-08 19:18:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:37,859 INFO L471 AbstractCegarLoop]: Abstraction has 3127 states and 4483 transitions. [2024-11-08 19:18:37,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 4483 transitions. [2024-11-08 19:18:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 19:18:37,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:37,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:37,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-08 19:18:37,861 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:37,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:37,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1295551150, now seen corresponding path program 1 times [2024-11-08 19:18:37,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:37,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236317137] [2024-11-08 19:18:37,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:37,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:38,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:38,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236317137] [2024-11-08 19:18:38,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236317137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:38,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:38,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:18:38,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420334296] [2024-11-08 19:18:38,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:38,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:18:38,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:38,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:18:38,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:38,372 INFO L87 Difference]: Start difference. First operand 3127 states and 4483 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:38,425 INFO L93 Difference]: Finished difference Result 6175 states and 8854 transitions. [2024-11-08 19:18:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:38,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 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 167 [2024-11-08 19:18:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:38,428 INFO L225 Difference]: With dead ends: 6175 [2024-11-08 19:18:38,428 INFO L226 Difference]: Without dead ends: 3145 [2024-11-08 19:18:38,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:38,430 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 1 mSDsluCounter, 5333 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6404 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:38,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6404 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2024-11-08 19:18:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 2565. [2024-11-08 19:18:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.4294071762870515) internal successors, (3665), 2564 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3665 transitions. [2024-11-08 19:18:38,451 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3665 transitions. Word has length 167 [2024-11-08 19:18:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:38,452 INFO L471 AbstractCegarLoop]: Abstraction has 2565 states and 3665 transitions. [2024-11-08 19:18:38,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3665 transitions. [2024-11-08 19:18:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 19:18:38,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:38,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:38,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-08 19:18:38,454 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:38,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:38,454 INFO L85 PathProgramCache]: Analyzing trace with hash -163701935, now seen corresponding path program 1 times [2024-11-08 19:18:38,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:38,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334134916] [2024-11-08 19:18:38,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:38,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:40,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:40,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334134916] [2024-11-08 19:18:40,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334134916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:40,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:40,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2024-11-08 19:18:40,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631093845] [2024-11-08 19:18:40,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:40,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 19:18:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:40,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 19:18:40,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2024-11-08 19:18:40,172 INFO L87 Difference]: Start difference. First operand 2565 states and 3665 transitions. Second operand has 31 states, 31 states have (on average 5.419354838709677) internal successors, (168), 31 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:40,885 INFO L93 Difference]: Finished difference Result 5235 states and 7476 transitions. [2024-11-08 19:18:40,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 19:18:40,886 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.419354838709677) internal successors, (168), 31 states have internal predecessors, (168), 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 168 [2024-11-08 19:18:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:40,888 INFO L225 Difference]: With dead ends: 5235 [2024-11-08 19:18:40,888 INFO L226 Difference]: Without dead ends: 2767 [2024-11-08 19:18:40,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2024-11-08 19:18:40,890 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 121 mSDsluCounter, 27420 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 28436 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:40,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 28436 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 19:18:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2767 states. [2024-11-08 19:18:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2767 to 2687. [2024-11-08 19:18:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2686 states have (on average 1.4307520476545048) internal successors, (3843), 2686 states have internal predecessors, (3843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3843 transitions. [2024-11-08 19:18:40,910 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3843 transitions. Word has length 168 [2024-11-08 19:18:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:40,910 INFO L471 AbstractCegarLoop]: Abstraction has 2687 states and 3843 transitions. [2024-11-08 19:18:40,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.419354838709677) internal successors, (168), 31 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3843 transitions. [2024-11-08 19:18:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 19:18:40,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:40,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:40,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-08 19:18:40,912 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:40,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2067406275, now seen corresponding path program 1 times [2024-11-08 19:18:40,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:40,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421988758] [2024-11-08 19:18:40,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:40,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:41,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:41,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421988758] [2024-11-08 19:18:41,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421988758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:41,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:41,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:41,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115890435] [2024-11-08 19:18:41,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:41,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:41,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:41,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:41,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:41,393 INFO L87 Difference]: Start difference. First operand 2687 states and 3843 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:41,473 INFO L93 Difference]: Finished difference Result 5245 states and 7498 transitions. [2024-11-08 19:18:41,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:41,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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 168 [2024-11-08 19:18:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:41,476 INFO L225 Difference]: With dead ends: 5245 [2024-11-08 19:18:41,476 INFO L226 Difference]: Without dead ends: 2655 [2024-11-08 19:18:41,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:41,478 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 942 mSDsluCounter, 3141 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 4193 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:41,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 4193 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2024-11-08 19:18:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2655. [2024-11-08 19:18:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2654 states have (on average 1.4276563677467973) internal successors, (3789), 2654 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3789 transitions. [2024-11-08 19:18:41,496 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3789 transitions. Word has length 168 [2024-11-08 19:18:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:41,497 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 3789 transitions. [2024-11-08 19:18:41,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3789 transitions. [2024-11-08 19:18:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 19:18:41,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:41,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:41,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-08 19:18:41,499 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:41,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1217818576, now seen corresponding path program 1 times [2024-11-08 19:18:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:41,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196352353] [2024-11-08 19:18:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:42,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:42,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196352353] [2024-11-08 19:18:42,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196352353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:42,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:42,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 19:18:42,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037569213] [2024-11-08 19:18:42,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:42,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 19:18:42,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:42,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 19:18:42,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:18:42,492 INFO L87 Difference]: Start difference. First operand 2655 states and 3789 transitions. Second operand has 20 states, 20 states have (on average 8.4) internal successors, (168), 20 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:42,860 INFO L93 Difference]: Finished difference Result 5739 states and 8176 transitions. [2024-11-08 19:18:42,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 19:18:42,861 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.4) internal successors, (168), 20 states have internal predecessors, (168), 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 168 [2024-11-08 19:18:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:42,864 INFO L225 Difference]: With dead ends: 5739 [2024-11-08 19:18:42,864 INFO L226 Difference]: Without dead ends: 3181 [2024-11-08 19:18:42,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2024-11-08 19:18:42,866 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 71 mSDsluCounter, 18830 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 19879 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:42,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 19879 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:18:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2024-11-08 19:18:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2911. [2024-11-08 19:18:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2911 states, 2910 states have (on average 1.4305841924398626) internal successors, (4163), 2910 states have internal predecessors, (4163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4163 transitions. [2024-11-08 19:18:42,887 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4163 transitions. Word has length 168 [2024-11-08 19:18:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:42,887 INFO L471 AbstractCegarLoop]: Abstraction has 2911 states and 4163 transitions. [2024-11-08 19:18:42,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.4) internal successors, (168), 20 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4163 transitions. [2024-11-08 19:18:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 19:18:42,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:42,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:42,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-08 19:18:42,889 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:42,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 14434580, now seen corresponding path program 1 times [2024-11-08 19:18:42,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:42,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891514439] [2024-11-08 19:18:42,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:42,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:43,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891514439] [2024-11-08 19:18:43,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891514439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:43,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:43,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:43,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602372564] [2024-11-08 19:18:43,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:43,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:43,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:43,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:43,271 INFO L87 Difference]: Start difference. First operand 2911 states and 4163 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:43,351 INFO L93 Difference]: Finished difference Result 6276 states and 8952 transitions. [2024-11-08 19:18:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:43,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 168 [2024-11-08 19:18:43,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:43,355 INFO L225 Difference]: With dead ends: 6276 [2024-11-08 19:18:43,355 INFO L226 Difference]: Without dead ends: 3460 [2024-11-08 19:18:43,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-08 19:18:43,358 INFO L432 NwaCegarLoop]: 1063 mSDtfsCounter, 1753 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 3181 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:43,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 3181 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-11-08 19:18:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 2907. [2024-11-08 19:18:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2907 states, 2906 states have (on average 1.430488644184446) internal successors, (4157), 2906 states have internal predecessors, (4157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 4157 transitions. [2024-11-08 19:18:43,381 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 4157 transitions. Word has length 168 [2024-11-08 19:18:43,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:43,381 INFO L471 AbstractCegarLoop]: Abstraction has 2907 states and 4157 transitions. [2024-11-08 19:18:43,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 4157 transitions. [2024-11-08 19:18:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 19:18:43,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:43,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:43,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-08 19:18:43,382 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:43,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:43,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1262500949, now seen corresponding path program 1 times [2024-11-08 19:18:43,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:43,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31931230] [2024-11-08 19:18:43,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:43,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:43,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31931230] [2024-11-08 19:18:43,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31931230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:43,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:43,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:18:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876791841] [2024-11-08 19:18:43,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:43,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:18:43,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:43,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:18:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:18:43,859 INFO L87 Difference]: Start difference. First operand 2907 states and 4157 transitions. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:43,932 INFO L93 Difference]: Finished difference Result 5769 states and 8246 transitions. [2024-11-08 19:18:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:18:43,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 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 169 [2024-11-08 19:18:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:43,935 INFO L225 Difference]: With dead ends: 5769 [2024-11-08 19:18:43,935 INFO L226 Difference]: Without dead ends: 2955 [2024-11-08 19:18:43,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:18:43,937 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 953 mSDsluCounter, 3144 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 4196 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:43,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 4196 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2024-11-08 19:18:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2943. [2024-11-08 19:18:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2943 states, 2942 states have (on average 1.429299796057104) internal successors, (4205), 2942 states have internal predecessors, (4205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 4205 transitions. [2024-11-08 19:18:43,954 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 4205 transitions. Word has length 169 [2024-11-08 19:18:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:43,954 INFO L471 AbstractCegarLoop]: Abstraction has 2943 states and 4205 transitions. [2024-11-08 19:18:43,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 4205 transitions. [2024-11-08 19:18:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 19:18:43,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:43,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:43,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-08 19:18:43,955 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:43,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash -403191623, now seen corresponding path program 1 times [2024-11-08 19:18:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:43,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143243998] [2024-11-08 19:18:43,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:43,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:46,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:46,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143243998] [2024-11-08 19:18:46,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143243998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:46,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:46,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2024-11-08 19:18:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128391615] [2024-11-08 19:18:46,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:46,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-08 19:18:46,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:46,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-08 19:18:46,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 19:18:46,487 INFO L87 Difference]: Start difference. First operand 2943 states and 4205 transitions. Second operand has 38 states, 38 states have (on average 4.447368421052632) internal successors, (169), 38 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:48,465 INFO L93 Difference]: Finished difference Result 5847 states and 8350 transitions. [2024-11-08 19:18:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-08 19:18:48,465 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.447368421052632) internal successors, (169), 38 states have internal predecessors, (169), 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 169 [2024-11-08 19:18:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:48,468 INFO L225 Difference]: With dead ends: 5847 [2024-11-08 19:18:48,468 INFO L226 Difference]: Without dead ends: 2997 [2024-11-08 19:18:48,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=262, Invalid=4430, Unknown=0, NotChecked=0, Total=4692 [2024-11-08 19:18:48,473 INFO L432 NwaCegarLoop]: 982 mSDtfsCounter, 1625 mSDsluCounter, 33463 mSDsCounter, 0 mSdLazyCounter, 3462 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 34445 SdHoareTripleChecker+Invalid, 3490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:48,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 34445 Invalid, 3490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3462 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 19:18:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2024-11-08 19:18:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2986. [2024-11-08 19:18:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2985 states have (on average 1.4294807370184255) internal successors, (4267), 2985 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 4267 transitions. [2024-11-08 19:18:48,495 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 4267 transitions. Word has length 169 [2024-11-08 19:18:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:48,495 INFO L471 AbstractCegarLoop]: Abstraction has 2986 states and 4267 transitions. [2024-11-08 19:18:48,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.447368421052632) internal successors, (169), 38 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 4267 transitions. [2024-11-08 19:18:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 19:18:48,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:48,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:48,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-08 19:18:48,496 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:48,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:48,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1950507560, now seen corresponding path program 1 times [2024-11-08 19:18:48,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:48,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301433582] [2024-11-08 19:18:48,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:49,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301433582] [2024-11-08 19:18:49,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301433582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:49,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:49,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:18:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352670556] [2024-11-08 19:18:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:49,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:18:49,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:49,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:18:49,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:49,399 INFO L87 Difference]: Start difference. First operand 2986 states and 4267 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:49,470 INFO L93 Difference]: Finished difference Result 5899 states and 8426 transitions. [2024-11-08 19:18:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:18:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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 170 [2024-11-08 19:18:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:49,473 INFO L225 Difference]: With dead ends: 5899 [2024-11-08 19:18:49,474 INFO L226 Difference]: Without dead ends: 2995 [2024-11-08 19:18:49,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:18:49,476 INFO L432 NwaCegarLoop]: 1069 mSDtfsCounter, 1050 mSDsluCounter, 4250 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 5319 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:49,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 5319 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:18:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2024-11-08 19:18:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2992. [2024-11-08 19:18:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2992 states, 2991 states have (on average 1.4276161818789703) internal successors, (4270), 2991 states have internal predecessors, (4270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 4270 transitions. [2024-11-08 19:18:49,498 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 4270 transitions. Word has length 170 [2024-11-08 19:18:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:49,498 INFO L471 AbstractCegarLoop]: Abstraction has 2992 states and 4270 transitions. [2024-11-08 19:18:49,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 4270 transitions. [2024-11-08 19:18:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 19:18:49,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:49,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:49,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-08 19:18:49,499 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:49,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:49,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1592016951, now seen corresponding path program 1 times [2024-11-08 19:18:49,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:49,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622719549] [2024-11-08 19:18:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:18:49,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:18:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:18:49,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:18:49,907 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:18:49,908 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:18:49,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-08 19:18:49,912 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:50,018 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:18:50,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:18:50 BoogieIcfgContainer [2024-11-08 19:18:50,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:18:50,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:18:50,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:18:50,021 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:18:50,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:17:57" (3/4) ... [2024-11-08 19:18:50,023 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:18:50,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:18:50,024 INFO L158 Benchmark]: Toolchain (without parser) took 56495.14ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 92.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 381.2MB. Max. memory is 16.1GB. [2024-11-08 19:18:50,024 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:18:50,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.38ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 94.4MB in the end (delta: -2.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2024-11-08 19:18:50,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 376.31ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 94.4MB in the beginning and 149.2MB in the end (delta: -54.8MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2024-11-08 19:18:50,026 INFO L158 Benchmark]: Boogie Preprocessor took 440.42ms. Allocated memory is still 234.9MB. Free memory was 149.2MB in the beginning and 140.0MB in the end (delta: 9.2MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2024-11-08 19:18:50,026 INFO L158 Benchmark]: RCFGBuilder took 2868.38ms. Allocated memory was 234.9MB in the beginning and 469.8MB in the end (delta: 234.9MB). Free memory was 140.0MB in the beginning and 229.7MB in the end (delta: -89.7MB). Peak memory consumption was 147.7MB. Max. memory is 16.1GB. [2024-11-08 19:18:50,029 INFO L158 Benchmark]: TraceAbstraction took 52155.01ms. Allocated memory was 469.8MB in the beginning and 1.9GB in the end (delta: 1.4GB). Free memory was 228.6MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. [2024-11-08 19:18:50,029 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 1.9GB. Free memory is still 1.4GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:18:50,030 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.22ms. Allocated memory is still 167.8MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 645.38ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 94.4MB in the end (delta: -2.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 376.31ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 94.4MB in the beginning and 149.2MB in the end (delta: -54.8MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 440.42ms. Allocated memory is still 234.9MB. Free memory was 149.2MB in the beginning and 140.0MB in the end (delta: 9.2MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2868.38ms. Allocated memory was 234.9MB in the beginning and 469.8MB in the end (delta: 234.9MB). Free memory was 140.0MB in the beginning and 229.7MB in the end (delta: -89.7MB). Peak memory consumption was 147.7MB. Max. memory is 16.1GB. * TraceAbstraction took 52155.01ms. Allocated memory was 469.8MB in the beginning and 1.9GB in the end (delta: 1.4GB). Free memory was 228.6MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 1.9GB. Free memory is still 1.4GB. 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 423, overapproximation of bitwiseAnd at line 428. 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 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_24 mask_SORT_24 = (SORT_24)-1 >> (sizeof(SORT_24) * 8 - 2); [L39] const SORT_24 msb_SORT_24 = (SORT_24)1 << (2 - 1); [L41] const SORT_181 mask_SORT_181 = (SORT_181)-1 >> (sizeof(SORT_181) * 8 - 4); [L42] const SORT_181 msb_SORT_181 = (SORT_181)1 << (4 - 1); [L44] const SORT_229 mask_SORT_229 = (SORT_229)-1 >> (sizeof(SORT_229) * 8 - 32); [L45] const SORT_229 msb_SORT_229 = (SORT_229)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_10 var_12 = 3; [L49] const SORT_10 var_15 = 2; [L50] const SORT_10 var_18 = 0; [L51] const SORT_1 var_22 = 1; [L52] const SORT_24 var_26 = 0; [L53] const SORT_24 var_29 = 3; [L54] const SORT_3 var_34 = 0; [L55] const SORT_1 var_50 = 0; [L56] const SORT_10 var_146 = 1; [L57] const SORT_10 var_151 = 4; [L58] const SORT_10 var_153 = 5; [L59] const SORT_10 var_197 = 7; [L60] const SORT_10 var_202 = 6; [L61] const SORT_229 var_231 = 0; [L62] const SORT_3 var_246 = 2; [L63] const SORT_3 var_268 = 31; [L65] SORT_1 input_2; [L66] SORT_3 input_4; [L67] SORT_5 input_6; [L68] SORT_3 input_257; [L69] SORT_3 input_258; [L70] SORT_3 input_259; [L71] SORT_3 input_267; [L72] SORT_3 input_277; [L73] SORT_3 input_278; [L74] SORT_3 input_279; [L75] SORT_3 input_282; [L76] SORT_3 input_301; [L77] SORT_3 input_302; [L78] SORT_3 input_303; [L79] SORT_3 input_306; [L80] SORT_3 input_308; [L81] SORT_24 input_322; [L82] SORT_24 input_323; [L83] SORT_24 input_324; [L85] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L85] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L86] SORT_10 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L87] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L88] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L89] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L90] SORT_1 state_127 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L91] SORT_3 state_129 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L92] SORT_3 state_131 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L93] SORT_3 state_133 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L94] SORT_3 state_135 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L95] SORT_3 state_137 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L96] SORT_3 state_139 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0, var_7=0] [L97] SORT_3 state_141 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L99] SORT_5 init_9_arg_1 = var_7; [L100] state_8 = init_9_arg_1 [L101] SORT_10 init_20_arg_1 = var_18; [L102] state_19 = init_20_arg_1 [L103] SORT_3 init_36_arg_1 = var_34; [L104] state_35 = init_36_arg_1 [L105] SORT_3 init_40_arg_1 = var_34; [L106] state_39 = init_40_arg_1 [L107] SORT_3 init_46_arg_1 = var_34; [L108] state_45 = init_46_arg_1 [L109] SORT_1 init_128_arg_1 = var_50; [L110] state_127 = init_128_arg_1 [L111] SORT_3 init_130_arg_1 = var_34; [L112] state_129 = init_130_arg_1 [L113] SORT_3 init_132_arg_1 = var_34; [L114] state_131 = init_132_arg_1 [L115] SORT_3 init_134_arg_1 = var_34; [L116] state_133 = init_134_arg_1 [L117] SORT_3 init_136_arg_1 = var_34; [L118] state_135 = init_136_arg_1 [L119] SORT_3 init_138_arg_1 = var_34; [L120] state_137 = init_138_arg_1 [L121] SORT_3 init_140_arg_1 = var_34; [L122] state_139 = init_140_arg_1 [L123] SORT_3 init_142_arg_1 = var_34; [L124] state_141 = init_142_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L127] input_2 = __VERIFIER_nondet_uchar() [L128] input_4 = __VERIFIER_nondet_uchar() [L129] input_6 = __VERIFIER_nondet_ushort() [L130] input_257 = __VERIFIER_nondet_uchar() [L131] input_258 = __VERIFIER_nondet_uchar() [L132] input_259 = __VERIFIER_nondet_uchar() [L133] input_267 = __VERIFIER_nondet_uchar() [L134] input_277 = __VERIFIER_nondet_uchar() [L135] input_278 = __VERIFIER_nondet_uchar() [L136] input_279 = __VERIFIER_nondet_uchar() [L137] input_282 = __VERIFIER_nondet_uchar() [L138] input_301 = __VERIFIER_nondet_uchar() [L139] input_302 = __VERIFIER_nondet_uchar() [L140] input_303 = __VERIFIER_nondet_uchar() [L141] input_306 = __VERIFIER_nondet_uchar() [L142] input_308 = __VERIFIER_nondet_uchar() [L143] input_322 = __VERIFIER_nondet_uchar() [L144] input_323 = __VERIFIER_nondet_uchar() [L145] input_324 = __VERIFIER_nondet_uchar() [L148] SORT_5 var_11_arg_0 = state_8; [L149] SORT_10 var_11 = var_11_arg_0 >> 9; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L150] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_12=3, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L150] var_11 = var_11 & mask_SORT_10 [L151] SORT_10 var_13_arg_0 = var_11; [L152] SORT_10 var_13_arg_1 = var_12; [L153] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L154] SORT_5 var_14_arg_0 = state_8; [L155] SORT_10 var_14 = var_14_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L156] EXPR var_14 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L156] var_14 = var_14 & mask_SORT_10 [L157] SORT_10 var_16_arg_0 = var_14; [L158] SORT_10 var_16_arg_1 = var_15; [L159] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L160] SORT_1 var_17_arg_0 = var_13; [L161] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17_arg_0=0, var_17_arg_1=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L162] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L162] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L163] SORT_10 var_21_arg_0 = state_19; [L164] SORT_1 var_21 = var_21_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_21=0, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L165] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L165] var_21 = var_21 & mask_SORT_1 [L166] SORT_1 var_23_arg_0 = var_21; [L167] SORT_1 var_23_arg_1 = var_22; [L168] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L169] SORT_10 var_25_arg_0 = state_19; [L170] SORT_24 var_25 = var_25_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_23=0, var_246=2, var_25=0, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L171] EXPR var_25 & mask_SORT_24 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_23=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L171] var_25 = var_25 & mask_SORT_24 [L172] SORT_24 var_27_arg_0 = var_25; [L173] SORT_24 var_27_arg_1 = var_26; [L174] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L175] SORT_1 var_28_arg_0 = var_23; [L176] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_25=0, var_268=31, var_26=0, var_28_arg_0=0, var_28_arg_1=1, var_29=3, var_34=0, var_50=0] [L177] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_25=0, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L177] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L178] SORT_24 var_30_arg_0 = var_25; [L179] SORT_24 var_30_arg_1 = var_29; [L180] SORT_1 var_30 = var_30_arg_0 == var_30_arg_1; [L181] SORT_1 var_31_arg_0 = var_28; [L182] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_31_arg_0=1, var_31_arg_1=0, var_34=0, var_50=0] [L183] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_17=0, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L183] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L184] SORT_1 var_32_arg_0 = var_17; [L185] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_32_arg_0=0, var_32_arg_1=1, var_34=0, var_50=0] [L186] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L186] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L187] SORT_1 var_33_arg_0 = var_32; [L188] SORT_1 var_33 = ~var_33_arg_0; [L189] SORT_3 var_37_arg_0 = state_35; [L190] SORT_1 var_37 = var_37_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_50=0] [L191] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L191] var_37 = var_37 & mask_SORT_1 [L192] SORT_1 var_38_arg_0 = var_37; [L193] SORT_1 var_38_arg_1 = var_22; [L194] SORT_1 var_38 = var_38_arg_0 == var_38_arg_1; [L195] SORT_3 var_41_arg_0 = state_39; [L196] SORT_1 var_41 = var_41_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_38=0, var_41=0, var_50=0] [L197] EXPR var_41 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_38=0, var_50=0] [L197] var_41 = var_41 & mask_SORT_1 [L198] SORT_1 var_42_arg_0 = var_41; [L199] SORT_1 var_42_arg_1 = var_22; [L200] SORT_1 var_42 = var_42_arg_0 == var_42_arg_1; [L201] SORT_1 var_43_arg_0 = var_38; [L202] SORT_1 var_43_arg_1 = var_42; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_43_arg_0=0, var_43_arg_1=0, var_50=0] [L203] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_50=0] [L203] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L204] SORT_1 var_44_arg_0 = var_43; [L205] SORT_1 var_44 = ~var_44_arg_0; [L206] SORT_3 var_47_arg_0 = state_45; [L207] SORT_1 var_47 = var_47_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_44=-1, var_47=0, var_50=0] [L208] EXPR var_47 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_44=-1, var_50=0] [L208] var_47 = var_47 & mask_SORT_1 [L209] SORT_1 var_48_arg_0 = var_47; [L210] SORT_1 var_48_arg_1 = var_22; [L211] SORT_1 var_48 = var_48_arg_0 == var_48_arg_1; [L212] SORT_1 var_49_arg_0 = var_44; [L213] SORT_1 var_49_arg_1 = var_48; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_47=0, var_49_arg_0=-1, var_49_arg_1=0, var_50=0] [L214] EXPR var_49_arg_0 | var_49_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_41=0, var_47=0, var_50=0] [L214] SORT_1 var_49 = var_49_arg_0 | var_49_arg_1; [L215] SORT_1 var_51_arg_0 = var_47; [L216] SORT_1 var_51_arg_1 = var_50; [L217] SORT_1 var_51 = var_51_arg_0 == var_51_arg_1; [L218] SORT_1 var_52_arg_0 = var_37; [L219] SORT_1 var_52_arg_1 = var_22; [L220] SORT_1 var_52 = var_52_arg_0 == var_52_arg_1; [L221] SORT_1 var_53_arg_0 = var_41; [L222] SORT_1 var_53_arg_1 = var_22; [L223] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L224] SORT_1 var_54_arg_0 = var_52; [L225] SORT_1 var_54_arg_1 = var_53; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0, var_51=1, var_54_arg_0=0, var_54_arg_1=0] [L226] EXPR var_54_arg_0 & var_54_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0, var_51=1] [L226] SORT_1 var_54 = var_54_arg_0 & var_54_arg_1; [L227] SORT_1 var_55_arg_0 = var_51; [L228] SORT_1 var_55_arg_1 = var_54; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0, var_55_arg_0=1, var_55_arg_1=0] [L229] EXPR var_55_arg_0 | var_55_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_49=255, var_50=0] [L229] SORT_1 var_55 = var_55_arg_0 | var_55_arg_1; [L230] SORT_1 var_56_arg_0 = var_49; [L231] SORT_1 var_56_arg_1 = var_55; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56_arg_0=255, var_56_arg_1=1] [L232] EXPR var_56_arg_0 & var_56_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L232] SORT_1 var_56 = var_56_arg_0 & var_56_arg_1; [L233] SORT_3 var_57_arg_0 = state_35; [L234] SORT_1 var_57 = var_57_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0] [L235] EXPR var_57 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1] [L235] var_57 = var_57 & mask_SORT_1 [L236] SORT_1 var_58_arg_0 = var_57; [L237] SORT_1 var_58_arg_1 = var_22; [L238] SORT_1 var_58 = var_58_arg_0 == var_58_arg_1; [L239] SORT_3 var_59_arg_0 = state_39; [L240] SORT_1 var_59 = var_59_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_58=0, var_59=0] [L241] EXPR var_59 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_58=0] [L241] var_59 = var_59 & mask_SORT_1 [L242] SORT_1 var_60_arg_0 = var_59; [L243] SORT_1 var_60_arg_1 = var_22; [L244] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L245] SORT_1 var_61_arg_0 = var_58; [L246] SORT_1 var_61_arg_1 = var_60; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_61_arg_0=0, var_61_arg_1=0] [L247] EXPR var_61_arg_0 & var_61_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0] [L247] SORT_1 var_61 = var_61_arg_0 & var_61_arg_1; [L248] SORT_1 var_62_arg_0 = var_61; [L249] SORT_1 var_62 = ~var_62_arg_0; [L250] SORT_3 var_63_arg_0 = state_45; [L251] SORT_1 var_63 = var_63_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_62=-1, var_63=0] [L252] EXPR var_63 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_62=-1] [L252] var_63 = var_63 & mask_SORT_1 [L253] SORT_1 var_64_arg_0 = var_63; [L254] SORT_1 var_64_arg_1 = var_22; [L255] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L256] SORT_1 var_65_arg_0 = var_62; [L257] SORT_1 var_65_arg_1 = var_64; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_63=0, var_65_arg_0=-1, var_65_arg_1=0] [L258] EXPR var_65_arg_0 | var_65_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_56=1, var_57=0, var_59=0, var_63=0] [L258] SORT_1 var_65 = var_65_arg_0 | var_65_arg_1; [L259] SORT_1 var_66_arg_0 = var_56; [L260] SORT_1 var_66_arg_1 = var_65; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_57=0, var_59=0, var_63=0, var_66_arg_0=1, var_66_arg_1=255] [L261] EXPR var_66_arg_0 & var_66_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_57=0, var_59=0, var_63=0] [L261] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L262] SORT_1 var_67_arg_0 = var_63; [L263] SORT_1 var_67_arg_1 = var_50; [L264] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L265] SORT_1 var_68_arg_0 = var_57; [L266] SORT_1 var_68_arg_1 = var_22; [L267] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L268] SORT_1 var_69_arg_0 = var_59; [L269] SORT_1 var_69_arg_1 = var_22; [L270] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L271] SORT_1 var_70_arg_0 = var_68; [L272] SORT_1 var_70_arg_1 = var_69; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1, var_67=1, var_70_arg_0=0, var_70_arg_1=0] [L273] EXPR var_70_arg_0 & var_70_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1, var_67=1] [L273] SORT_1 var_70 = var_70_arg_0 & var_70_arg_1; [L274] SORT_1 var_71_arg_0 = var_67; [L275] SORT_1 var_71_arg_1 = var_70; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1, var_71_arg_0=1, var_71_arg_1=0] [L276] EXPR var_71_arg_0 | var_71_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_66=1] [L276] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L277] SORT_1 var_72_arg_0 = var_66; [L278] SORT_1 var_72_arg_1 = var_71; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72_arg_0=1, var_72_arg_1=1] [L279] EXPR var_72_arg_0 & var_72_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L279] SORT_1 var_72 = var_72_arg_0 & var_72_arg_1; [L280] SORT_3 var_73_arg_0 = state_35; [L281] SORT_1 var_73 = var_73_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0] [L282] EXPR var_73 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1] [L282] var_73 = var_73 & mask_SORT_1 [L283] SORT_1 var_74_arg_0 = var_73; [L284] SORT_1 var_74_arg_1 = var_22; [L285] SORT_1 var_74 = var_74_arg_0 == var_74_arg_1; [L286] SORT_3 var_75_arg_0 = state_39; [L287] SORT_1 var_75 = var_75_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_74=0, var_75=0] [L288] EXPR var_75 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_74=0] [L288] var_75 = var_75 & mask_SORT_1 [L289] SORT_1 var_76_arg_0 = var_75; [L290] SORT_1 var_76_arg_1 = var_22; [L291] SORT_1 var_76 = var_76_arg_0 == var_76_arg_1; [L292] SORT_1 var_77_arg_0 = var_74; [L293] SORT_1 var_77_arg_1 = var_76; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_77_arg_0=0, var_77_arg_1=0] [L294] EXPR var_77_arg_0 & var_77_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0] [L294] SORT_1 var_77 = var_77_arg_0 & var_77_arg_1; [L295] SORT_1 var_78_arg_0 = var_77; [L296] SORT_1 var_78 = ~var_78_arg_0; [L297] SORT_3 var_79_arg_0 = state_45; [L298] SORT_1 var_79 = var_79_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_78=-1, var_79=0] [L299] EXPR var_79 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_78=-1] [L299] var_79 = var_79 & mask_SORT_1 [L300] SORT_1 var_80_arg_0 = var_79; [L301] SORT_1 var_80_arg_1 = var_22; [L302] SORT_1 var_80 = var_80_arg_0 == var_80_arg_1; [L303] SORT_1 var_81_arg_0 = var_78; [L304] SORT_1 var_81_arg_1 = var_80; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_79=0, var_81_arg_0=-1, var_81_arg_1=0] [L305] EXPR var_81_arg_0 | var_81_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_72=1, var_73=0, var_75=0, var_79=0] [L305] SORT_1 var_81 = var_81_arg_0 | var_81_arg_1; [L306] SORT_1 var_82_arg_0 = var_72; [L307] SORT_1 var_82_arg_1 = var_81; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_73=0, var_75=0, var_79=0, var_82_arg_0=1, var_82_arg_1=255] [L308] EXPR var_82_arg_0 & var_82_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_73=0, var_75=0, var_79=0] [L308] SORT_1 var_82 = var_82_arg_0 & var_82_arg_1; [L309] SORT_1 var_83_arg_0 = var_79; [L310] SORT_1 var_83_arg_1 = var_50; [L311] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L312] SORT_1 var_84_arg_0 = var_73; [L313] SORT_1 var_84_arg_1 = var_22; [L314] SORT_1 var_84 = var_84_arg_0 == var_84_arg_1; [L315] SORT_1 var_85_arg_0 = var_75; [L316] SORT_1 var_85_arg_1 = var_22; [L317] SORT_1 var_85 = var_85_arg_0 == var_85_arg_1; [L318] SORT_1 var_86_arg_0 = var_84; [L319] SORT_1 var_86_arg_1 = var_85; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1, var_83=1, var_86_arg_0=0, var_86_arg_1=0] [L320] EXPR var_86_arg_0 & var_86_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1, var_83=1] [L320] SORT_1 var_86 = var_86_arg_0 & var_86_arg_1; [L321] SORT_1 var_87_arg_0 = var_83; [L322] SORT_1 var_87_arg_1 = var_86; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1, var_87_arg_0=1, var_87_arg_1=0] [L323] EXPR var_87_arg_0 | var_87_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_82=1] [L323] SORT_1 var_87 = var_87_arg_0 | var_87_arg_1; [L324] SORT_1 var_88_arg_0 = var_82; [L325] SORT_1 var_88_arg_1 = var_87; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88_arg_0=1, var_88_arg_1=1] [L326] EXPR var_88_arg_0 & var_88_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L326] SORT_1 var_88 = var_88_arg_0 & var_88_arg_1; [L327] SORT_3 var_89_arg_0 = state_35; [L328] SORT_1 var_89 = var_89_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0] [L329] EXPR var_89 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1] [L329] var_89 = var_89 & mask_SORT_1 [L330] SORT_1 var_90_arg_0 = var_89; [L331] SORT_1 var_90_arg_1 = var_22; [L332] SORT_1 var_90 = var_90_arg_0 == var_90_arg_1; [L333] SORT_3 var_91_arg_0 = state_39; [L334] SORT_1 var_91 = var_91_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_90=0, var_91=0] [L335] EXPR var_91 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_90=0] [L335] var_91 = var_91 & mask_SORT_1 [L336] SORT_1 var_92_arg_0 = var_91; [L337] SORT_1 var_92_arg_1 = var_22; [L338] SORT_1 var_92 = var_92_arg_0 == var_92_arg_1; [L339] SORT_1 var_93_arg_0 = var_90; [L340] SORT_1 var_93_arg_1 = var_92; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_93_arg_0=0, var_93_arg_1=0] [L341] EXPR var_93_arg_0 & var_93_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0] [L341] SORT_1 var_93 = var_93_arg_0 & var_93_arg_1; [L342] SORT_1 var_94_arg_0 = var_93; [L343] SORT_1 var_94 = ~var_94_arg_0; [L344] SORT_3 var_95_arg_0 = state_45; [L345] SORT_1 var_95 = var_95_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_94=-1, var_95=0] [L346] EXPR var_95 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_94=-1] [L346] var_95 = var_95 & mask_SORT_1 [L347] SORT_1 var_96_arg_0 = var_95; [L348] SORT_1 var_96_arg_1 = var_22; [L349] SORT_1 var_96 = var_96_arg_0 == var_96_arg_1; [L350] SORT_1 var_97_arg_0 = var_94; [L351] SORT_1 var_97_arg_1 = var_96; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_95=0, var_97_arg_0=-1, var_97_arg_1=0] [L352] EXPR var_97_arg_0 | var_97_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_88=1, var_89=0, var_91=0, var_95=0] [L352] SORT_1 var_97 = var_97_arg_0 | var_97_arg_1; [L353] SORT_1 var_98_arg_0 = var_88; [L354] SORT_1 var_98_arg_1 = var_97; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_89=0, var_91=0, var_95=0, var_98_arg_0=1, var_98_arg_1=255] [L355] EXPR var_98_arg_0 & var_98_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_89=0, var_91=0, var_95=0] [L355] SORT_1 var_98 = var_98_arg_0 & var_98_arg_1; [L356] SORT_1 var_99_arg_0 = var_95; [L357] SORT_1 var_99_arg_1 = var_50; [L358] SORT_1 var_99 = var_99_arg_0 == var_99_arg_1; [L359] SORT_1 var_100_arg_0 = var_89; [L360] SORT_1 var_100_arg_1 = var_22; [L361] SORT_1 var_100 = var_100_arg_0 == var_100_arg_1; [L362] SORT_1 var_101_arg_0 = var_91; [L363] SORT_1 var_101_arg_1 = var_22; [L364] SORT_1 var_101 = var_101_arg_0 == var_101_arg_1; [L365] SORT_1 var_102_arg_0 = var_100; [L366] SORT_1 var_102_arg_1 = var_101; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_102_arg_0=0, var_102_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1, var_99=1] [L367] EXPR var_102_arg_0 & var_102_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1, var_99=1] [L367] SORT_1 var_102 = var_102_arg_0 & var_102_arg_1; [L368] SORT_1 var_103_arg_0 = var_99; [L369] SORT_1 var_103_arg_1 = var_102; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_103_arg_0=1, var_103_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1] [L370] EXPR var_103_arg_0 | var_103_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0, var_98=1] [L370] SORT_1 var_103 = var_103_arg_0 | var_103_arg_1; [L371] SORT_1 var_104_arg_0 = var_98; [L372] SORT_1 var_104_arg_1 = var_103; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104_arg_0=1, var_104_arg_1=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L373] EXPR var_104_arg_0 & var_104_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L373] SORT_1 var_104 = var_104_arg_0 & var_104_arg_1; [L374] SORT_3 var_105_arg_0 = state_35; [L375] SORT_1 var_105 = var_105_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L376] EXPR var_105 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L376] var_105 = var_105 & mask_SORT_1 [L377] SORT_1 var_106_arg_0 = var_105; [L378] SORT_1 var_106_arg_1 = var_22; [L379] SORT_1 var_106 = var_106_arg_0 == var_106_arg_1; [L380] SORT_3 var_107_arg_0 = state_39; [L381] SORT_1 var_107 = var_107_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_106=0, var_107=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L382] EXPR var_107 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_106=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L382] var_107 = var_107 & mask_SORT_1 [L383] SORT_1 var_108_arg_0 = var_107; [L384] SORT_1 var_108_arg_1 = var_22; [L385] SORT_1 var_108 = var_108_arg_0 == var_108_arg_1; [L386] SORT_1 var_109_arg_0 = var_106; [L387] SORT_1 var_109_arg_1 = var_108; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_109_arg_0=0, var_109_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L388] EXPR var_109_arg_0 & var_109_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L388] SORT_1 var_109 = var_109_arg_0 & var_109_arg_1; [L389] SORT_1 var_110_arg_0 = var_109; [L390] SORT_1 var_110 = ~var_110_arg_0; [L391] SORT_3 var_111_arg_0 = state_45; [L392] SORT_1 var_111 = var_111_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_110=-1, var_111=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L393] EXPR var_111 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_110=-1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L393] var_111 = var_111 & mask_SORT_1 [L394] SORT_1 var_112_arg_0 = var_111; [L395] SORT_1 var_112_arg_1 = var_22; [L396] SORT_1 var_112 = var_112_arg_0 == var_112_arg_1; [L397] SORT_1 var_113_arg_0 = var_110; [L398] SORT_1 var_113_arg_1 = var_112; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_111=0, var_113_arg_0=-1, var_113_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L399] EXPR var_113_arg_0 | var_113_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_104=1, var_105=0, var_107=0, var_111=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L399] SORT_1 var_113 = var_113_arg_0 | var_113_arg_1; [L400] SORT_1 var_114_arg_0 = var_104; [L401] SORT_1 var_114_arg_1 = var_113; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_105=0, var_107=0, var_111=0, var_114_arg_0=1, var_114_arg_1=255, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L402] EXPR var_114_arg_0 & var_114_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_105=0, var_107=0, var_111=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L402] SORT_1 var_114 = var_114_arg_0 & var_114_arg_1; [L403] SORT_1 var_115_arg_0 = var_111; [L404] SORT_1 var_115_arg_1 = var_50; [L405] SORT_1 var_115 = var_115_arg_0 == var_115_arg_1; [L406] SORT_1 var_116_arg_0 = var_105; [L407] SORT_1 var_116_arg_1 = var_22; [L408] SORT_1 var_116 = var_116_arg_0 == var_116_arg_1; [L409] SORT_1 var_117_arg_0 = var_107; [L410] SORT_1 var_117_arg_1 = var_22; [L411] SORT_1 var_117 = var_117_arg_0 == var_117_arg_1; [L412] SORT_1 var_118_arg_0 = var_116; [L413] SORT_1 var_118_arg_1 = var_117; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_115=1, var_118_arg_0=0, var_118_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L414] EXPR var_118_arg_0 & var_118_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_115=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L414] SORT_1 var_118 = var_118_arg_0 & var_118_arg_1; [L415] SORT_1 var_119_arg_0 = var_115; [L416] SORT_1 var_119_arg_1 = var_118; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_119_arg_0=1, var_119_arg_1=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L417] EXPR var_119_arg_0 | var_119_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_114=1, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L417] SORT_1 var_119 = var_119_arg_0 | var_119_arg_1; [L418] SORT_1 var_120_arg_0 = var_114; [L419] SORT_1 var_120_arg_1 = var_119; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_120_arg_0=1, var_120_arg_1=1, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L420] EXPR var_120_arg_0 & var_120_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_50=0] [L420] SORT_1 var_120 = var_120_arg_0 & var_120_arg_1; [L421] SORT_1 var_121_arg_0 = var_33; [L422] SORT_1 var_121_arg_1 = var_120; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_121_arg_0=-1, var_121_arg_1=1, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L423] EXPR var_121_arg_0 | var_121_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L423] SORT_1 var_121 = var_121_arg_0 | var_121_arg_1; [L424] SORT_1 var_124_arg_0 = var_121; [L425] SORT_1 var_124 = ~var_124_arg_0; [L426] SORT_1 var_125_arg_0 = var_22; [L427] SORT_1 var_125_arg_1 = var_124; VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_125_arg_0=1, var_125_arg_1=-1, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L428] EXPR var_125_arg_0 & var_125_arg_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L428] SORT_1 var_125 = var_125_arg_0 & var_125_arg_1; [L429] EXPR var_125 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_181=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_127=0, state_129=0, state_131=0, state_133=0, state_135=0, state_137=0, state_139=0, state_141=0, state_19=0, state_35=0, state_39=0, state_45=0, state_8=0, var_11=0, var_12=3, var_13=0, var_146=1, var_14=0, var_151=4, var_153=5, var_15=2, var_18=0, var_197=7, var_202=6, var_22=1, var_231=0, var_246=2, var_268=31, var_26=0, var_29=3, var_34=0, var_50=0] [L429] var_125 = var_125 & mask_SORT_1 [L430] SORT_1 bad_126_arg_0 = var_125; [L431] CALL __VERIFIER_assert(!(bad_126_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 723 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.0s, OverallIterations: 58, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26742 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26742 mSDsluCounter, 444706 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 383817 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15934 IncrementalHoareTripleChecker+Invalid, 16048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 60889 mSDtfsCounter, 15934 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 152 SyntacticMatches, 16 SemanticMatches, 477 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3137occurred in iteration=47, InterpolantAutomatonStates: 499, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 57 MinimizatonAttempts, 4677 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 31.0s InterpolantComputationTime, 9189 NumberOfCodeBlocks, 9189 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 8961 ConstructedInterpolants, 0 QuantifiedInterpolants, 21048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 57 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-11-08 19:18:50,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.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 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:18:52,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:18:52,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 19:18:52,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:18:52,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:18:52,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:18:52,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:18:52,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:18:52,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:18:52,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:18:52,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:18:52,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:18:52,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:18:52,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:18:52,291 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:18:52,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:18:52,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:18:52,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:18:52,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:18:52,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:18:52,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:18:52,295 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:18:52,296 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:18:52,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:18:52,296 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:18:52,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:18:52,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:18:52,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:18:52,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:18:52,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:18:52,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:18:52,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:18:52,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:18:52,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:18:52,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:18:52,297 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:18:52,298 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:18:52,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:18:52,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:18:52,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:18:52,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:18:52,300 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 -> 4331b326563c28634161a81fb2ae86afdf4d504fa891c078bd10383b9144dfd4 [2024-11-08 19:18:52,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:18:52,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:18:52,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:18:52,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:18:52,619 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:18:52,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2024-11-08 19:18:53,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:18:54,205 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:18:54,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c [2024-11-08 19:18:54,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb4321c0/db2148a80e744c6f9db88bd298f24ece/FLAGe6a30c73b [2024-11-08 19:18:54,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb4321c0/db2148a80e744c6f9db88bd298f24ece [2024-11-08 19:18:54,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:18:54,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:18:54,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:18:54,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:18:54,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:18:54,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:54,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4085a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54, skipping insertion in model container [2024-11-08 19:18:54,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:54,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:18:54,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c[1259,1272] [2024-11-08 19:18:54,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:18:54,755 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:18:54,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p09.c[1259,1272] [2024-11-08 19:18:54,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:18:54,884 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:18:54,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54 WrapperNode [2024-11-08 19:18:54,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:18:54,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:18:54,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:18:54,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:18:54,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:54,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:54,988 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1326 [2024-11-08 19:18:54,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:18:54,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:18:54,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:18:54,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:18:55,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:55,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:55,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:55,051 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:18:55,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:55,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:55,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:55,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:55,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:55,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:55,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:18:55,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:18:55,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:18:55,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:18:55,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (1/1) ... [2024-11-08 19:18:55,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:18:55,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:18:55,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:18:55,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:18:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:18:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:18:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:18:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:18:55,487 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:18:55,490 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:18:56,684 INFO L? ?]: Removed 306 outVars from TransFormulas that were not future-live. [2024-11-08 19:18:56,684 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:18:56,692 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:18:56,693 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:18:56,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:18:56 BoogieIcfgContainer [2024-11-08 19:18:56,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:18:56,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:18:56,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:18:56,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:18:56,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:18:54" (1/3) ... [2024-11-08 19:18:56,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eea516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:18:56, skipping insertion in model container [2024-11-08 19:18:56,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:18:54" (2/3) ... [2024-11-08 19:18:56,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eea516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:18:56, skipping insertion in model container [2024-11-08 19:18:56,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:18:56" (3/3) ... [2024-11-08 19:18:56,701 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p09.c [2024-11-08 19:18:56,715 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:18:56,715 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:18:56,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:18:56,772 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;@35215b1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:18:56,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:18:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:18:56,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:56,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 19:18:56,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:56,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 19:18:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:18:56,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454385159] [2024-11-08 19:18:56,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:56,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:56,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:18:56,801 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:18:56,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:18:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:57,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 19:18:57,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:18:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:18:57,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:18:57,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:18:57,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454385159] [2024-11-08 19:18:57,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454385159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:57,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:57,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:18:57,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404652022] [2024-11-08 19:18:57,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:57,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:18:57,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:18:57,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:18:57,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:18:57,398 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:57,490 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 19:18:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:18:57,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-08 19:18:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:57,497 INFO L225 Difference]: With dead ends: 18 [2024-11-08 19:18:57,497 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 19:18:57,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:57,502 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:57,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 19:18:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 19:18:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 19:18:57,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 19:18:57,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:57,544 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 19:18:57,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:18:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 19:18:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:18:57,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:57,545 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:57,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:18:57,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:57,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:57,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 19:18:57,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:18:57,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073204356] [2024-11-08 19:18:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:57,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:18:57,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:18:57,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:18:57,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:18:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:58,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 19:18:58,999 INFO L278 TraceCheckSpWp]: Computing forward predicates...