./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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.vcegar_QF_BV_pj_icu_icctl_p2.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 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:59:41,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:59:41,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:59:41,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:59:41,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:59:41,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:59:41,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:59:41,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:59:41,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:59:41,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:59:41,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:59:41,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:59:41,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:59:41,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:59:41,320 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:59:41,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:59:41,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:59:41,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:59:41,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:59:41,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:59:41,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:59:41,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:59:41,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:59:41,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:59:41,326 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:59:41,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:59:41,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:59:41,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:59:41,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:59:41,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:59:41,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:59:41,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:59:41,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:59:41,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:59:41,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:59:41,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:59:41,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:59:41,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:59:41,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:59:41,330 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 -> 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f [2024-11-10 02:59:41,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:59:41,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:59:41,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:59:41,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:59:41,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:59:41,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-11-10 02:59:43,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:59:43,454 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:59:43,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-11-10 02:59:43,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f85d9f3c/a4eb9ab950d240c0918cfa080b4b0844/FLAGead3f3ff6 [2024-11-10 02:59:43,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f85d9f3c/a4eb9ab950d240c0918cfa080b4b0844 [2024-11-10 02:59:43,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:59:43,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:59:43,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:59:43,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:59:43,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:59:43,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:59:43" (1/1) ... [2024-11-10 02:59:43,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afbd7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:43, skipping insertion in model container [2024-11-10 02:59:43,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:59:43" (1/1) ... [2024-11-10 02:59:43,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:59:43,851 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2024-11-10 02:59:44,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:59:44,269 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:59:44,281 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2024-11-10 02:59:44,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:59:44,481 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:59:44,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44 WrapperNode [2024-11-10 02:59:44,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:59:44,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:59:44,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:59:44,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:59:44,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:44,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:45,106 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4880 [2024-11-10 02:59:45,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:59:45,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:59:45,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:59:45,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:59:45,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:45,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:45,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:45,349 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-10 02:59:45,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:45,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:45,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:45,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:45,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:45,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:45,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:59:45,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:59:45,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:59:45,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:59:45,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (1/1) ... [2024-11-10 02:59:45,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:59:45,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:59:45,684 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-10 02:59:45,690 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-10 02:59:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:59:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:59:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:59:45,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:59:46,172 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:59:46,177 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:59:50,251 INFO L? ?]: Removed 3163 outVars from TransFormulas that were not future-live. [2024-11-10 02:59:50,251 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:59:50,454 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:59:50,454 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:59:50,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:59:50 BoogieIcfgContainer [2024-11-10 02:59:50,455 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:59:50,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:59:50,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:59:50,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:59:50,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:59:43" (1/3) ... [2024-11-10 02:59:50,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ad79f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:59:50, skipping insertion in model container [2024-11-10 02:59:50,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:44" (2/3) ... [2024-11-10 02:59:50,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ad79f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:59:50, skipping insertion in model container [2024-11-10 02:59:50,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:59:50" (3/3) ... [2024-11-10 02:59:50,463 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-11-10 02:59:50,482 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:59:50,482 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:59:50,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:59:50,577 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;@65be9946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:59:50,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:59:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 1133 states, 1131 states have (on average 1.497789566755084) internal successors, (1694), 1132 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 02:59:50,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:50,604 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] [2024-11-10 02:59:50,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:50,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1069248364, now seen corresponding path program 1 times [2024-11-10 02:59:50,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:59:50,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2878378] [2024-11-10 02:59:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:50,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:59:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:51,620 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-10 02:59:51,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:59:51,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2878378] [2024-11-10 02:59:51,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2878378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:59:51,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:59:51,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:59:51,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346146865] [2024-11-10 02:59:51,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:59:51,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:59:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:59:51,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:59:51,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:59:51,665 INFO L87 Difference]: Start difference. First operand has 1133 states, 1131 states have (on average 1.497789566755084) internal successors, (1694), 1132 states have internal predecessors, (1694), 0 states have call successors, (0), 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 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:52,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:59:52,378 INFO L93 Difference]: Finished difference Result 2145 states and 3211 transitions. [2024-11-10 02:59:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:59:52,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-10 02:59:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:59:52,403 INFO L225 Difference]: With dead ends: 2145 [2024-11-10 02:59:52,404 INFO L226 Difference]: Without dead ends: 1130 [2024-11-10 02:59:52,411 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-10 02:59:52,414 INFO L432 NwaCegarLoop]: 1406 mSDtfsCounter, 0 mSDsluCounter, 2807 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4213 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 02:59:52,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4213 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 02:59:52,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-11-10 02:59:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2024-11-10 02:59:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 1.4968999114260408) internal successors, (1690), 1129 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1690 transitions. [2024-11-10 02:59:52,521 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1690 transitions. Word has length 92 [2024-11-10 02:59:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:59:52,522 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1690 transitions. [2024-11-10 02:59:52,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1690 transitions. [2024-11-10 02:59:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 02:59:52,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:52,526 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] [2024-11-10 02:59:52,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:59:52,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:52,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1067984048, now seen corresponding path program 1 times [2024-11-10 02:59:52,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:59:52,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880104353] [2024-11-10 02:59:52,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:52,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:59:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:52,990 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-10 02:59:52,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:59:52,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880104353] [2024-11-10 02:59:52,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880104353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:59:52,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:59:52,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:59:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893409450] [2024-11-10 02:59:52,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:59:52,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:59:52,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:59:52,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:59:52,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:59:52,995 INFO L87 Difference]: Start difference. First operand 1130 states and 1690 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:59:53,615 INFO L93 Difference]: Finished difference Result 2144 states and 3207 transitions. [2024-11-10 02:59:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:59:53,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-10 02:59:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:59:53,625 INFO L225 Difference]: With dead ends: 2144 [2024-11-10 02:59:53,626 INFO L226 Difference]: Without dead ends: 1132 [2024-11-10 02:59:53,628 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-10 02:59:53,629 INFO L432 NwaCegarLoop]: 1406 mSDtfsCounter, 0 mSDsluCounter, 2804 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4210 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 02:59:53,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4210 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 02:59:53,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-10 02:59:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2024-11-10 02:59:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.4960212201591512) internal successors, (1692), 1131 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1692 transitions. [2024-11-10 02:59:53,665 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1692 transitions. Word has length 93 [2024-11-10 02:59:53,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:59:53,666 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1692 transitions. [2024-11-10 02:59:53,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1692 transitions. [2024-11-10 02:59:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 02:59:53,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:53,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] [2024-11-10 02:59:53,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:59:53,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:53,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:53,669 INFO L85 PathProgramCache]: Analyzing trace with hash 999478097, now seen corresponding path program 1 times [2024-11-10 02:59:53,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:59:53,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493091071] [2024-11-10 02:59:53,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:53,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:59:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:54,318 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-10 02:59:54,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:59:54,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493091071] [2024-11-10 02:59:54,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493091071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:59:54,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:59:54,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:59:54,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401662880] [2024-11-10 02:59:54,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:59:54,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:59:54,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:59:54,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:59:54,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:59:54,321 INFO L87 Difference]: Start difference. First operand 1132 states and 1692 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:55,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:59:55,158 INFO L93 Difference]: Finished difference Result 2150 states and 3214 transitions. [2024-11-10 02:59:55,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 02:59:55,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-10 02:59:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:59:55,167 INFO L225 Difference]: With dead ends: 2150 [2024-11-10 02:59:55,167 INFO L226 Difference]: Without dead ends: 1136 [2024-11-10 02:59:55,169 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-10 02:59:55,171 INFO L432 NwaCegarLoop]: 1400 mSDtfsCounter, 1609 mSDsluCounter, 4193 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1609 SdHoareTripleChecker+Valid, 5593 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 02:59:55,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1609 Valid, 5593 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 02:59:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2024-11-10 02:59:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1135. [2024-11-10 02:59:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 1.4947089947089947) internal successors, (1695), 1134 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1695 transitions. [2024-11-10 02:59:55,204 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1695 transitions. Word has length 94 [2024-11-10 02:59:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:59:55,206 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1695 transitions. [2024-11-10 02:59:55,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1695 transitions. [2024-11-10 02:59:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 02:59:55,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:55,211 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] [2024-11-10 02:59:55,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:59:55,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:55,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash -49961429, now seen corresponding path program 1 times [2024-11-10 02:59:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:59:55,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882720654] [2024-11-10 02:59:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:55,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:59:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:56,429 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-10 02:59:56,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:59:56,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882720654] [2024-11-10 02:59:56,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882720654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:59:56,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:59:56,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:59:56,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145497087] [2024-11-10 02:59:56,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:59:56,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:59:56,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:59:56,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:59:56,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:59:56,432 INFO L87 Difference]: Start difference. First operand 1135 states and 1695 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:59:57,202 INFO L93 Difference]: Finished difference Result 2197 states and 3281 transitions. [2024-11-10 02:59:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:59:57,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-10 02:59:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:59:57,207 INFO L225 Difference]: With dead ends: 2197 [2024-11-10 02:59:57,207 INFO L226 Difference]: Without dead ends: 1180 [2024-11-10 02:59:57,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:59:57,210 INFO L432 NwaCegarLoop]: 1389 mSDtfsCounter, 1757 mSDsluCounter, 2776 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 4165 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 02:59:57,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 4165 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 02:59:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-11-10 02:59:57,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1141. [2024-11-10 02:59:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.493859649122807) internal successors, (1703), 1140 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-10 02:59:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1703 transitions. [2024-11-10 02:59:57,237 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1703 transitions. Word has length 95 [2024-11-10 02:59:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:59:57,238 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1703 transitions. [2024-11-10 02:59:57,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1703 transitions. [2024-11-10 02:59:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 02:59:57,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:57,240 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] [2024-11-10 02:59:57,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:59:57,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:57,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:57,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1318659, now seen corresponding path program 1 times [2024-11-10 02:59:57,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:59:57,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531357237] [2024-11-10 02:59:57,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:57,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:59:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:58,033 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-10 02:59:58,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:59:58,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531357237] [2024-11-10 02:59:58,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531357237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:59:58,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:59:58,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:59:58,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214059057] [2024-11-10 02:59:58,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:59:58,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:59:58,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:59:58,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:59:58,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:59:58,036 INFO L87 Difference]: Start difference. First operand 1141 states and 1703 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:59:59,169 INFO L93 Difference]: Finished difference Result 2178 states and 3252 transitions. [2024-11-10 02:59:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:59:59,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-10 02:59:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:59:59,176 INFO L225 Difference]: With dead ends: 2178 [2024-11-10 02:59:59,176 INFO L226 Difference]: Without dead ends: 1161 [2024-11-10 02:59:59,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:59:59,182 INFO L432 NwaCegarLoop]: 1401 mSDtfsCounter, 18 mSDsluCounter, 7007 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8408 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:59:59,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 8408 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 02:59:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-11-10 02:59:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1158. [2024-11-10 02:59:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.4926534140017287) internal successors, (1727), 1157 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1727 transitions. [2024-11-10 02:59:59,214 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1727 transitions. Word has length 96 [2024-11-10 02:59:59,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:59:59,215 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1727 transitions. [2024-11-10 02:59:59,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:59:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1727 transitions. [2024-11-10 02:59:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 02:59:59,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:59,217 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] [2024-11-10 02:59:59,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 02:59:59,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:59,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:59,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1870831593, now seen corresponding path program 1 times [2024-11-10 02:59:59,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:59:59,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025352741] [2024-11-10 02:59:59,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:59,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:59:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:59,916 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-10 02:59:59,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:59:59,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025352741] [2024-11-10 02:59:59,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025352741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:59:59,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:59:59,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:59:59,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122244307] [2024-11-10 02:59:59,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:59:59,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:59:59,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:59:59,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:59:59,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:59:59,920 INFO L87 Difference]: Start difference. First operand 1158 states and 1727 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:01,062 INFO L93 Difference]: Finished difference Result 2246 states and 3349 transitions. [2024-11-10 03:00:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:00:01,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-10 03:00:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:01,067 INFO L225 Difference]: With dead ends: 2246 [2024-11-10 03:00:01,069 INFO L226 Difference]: Without dead ends: 1212 [2024-11-10 03:00:01,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:00:01,075 INFO L432 NwaCegarLoop]: 1389 mSDtfsCounter, 1759 mSDsluCounter, 5545 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 6934 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:01,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 6934 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 03:00:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-11-10 03:00:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1188. [2024-11-10 03:00:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1187 states have (on average 1.4911541701769166) internal successors, (1770), 1187 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1770 transitions. [2024-11-10 03:00:01,105 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1770 transitions. Word has length 97 [2024-11-10 03:00:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:01,106 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1770 transitions. [2024-11-10 03:00:01,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1770 transitions. [2024-11-10 03:00:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 03:00:01,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:01,107 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] [2024-11-10 03:00:01,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:00:01,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:01,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1071440562, now seen corresponding path program 1 times [2024-11-10 03:00:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:01,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795966610] [2024-11-10 03:00:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:02,045 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-10 03:00:02,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:02,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795966610] [2024-11-10 03:00:02,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795966610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:02,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 03:00:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758969897] [2024-11-10 03:00:02,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:02,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:00:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:02,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:00:02,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:00:02,048 INFO L87 Difference]: Start difference. First operand 1188 states and 1770 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:02,985 INFO L93 Difference]: Finished difference Result 2250 states and 3353 transitions. [2024-11-10 03:00:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 03:00:02,986 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-10 03:00:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:02,991 INFO L225 Difference]: With dead ends: 2250 [2024-11-10 03:00:02,991 INFO L226 Difference]: Without dead ends: 1216 [2024-11-10 03:00:02,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-10 03:00:02,995 INFO L432 NwaCegarLoop]: 1383 mSDtfsCounter, 1807 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 4335 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:02,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 4335 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 03:00:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-10 03:00:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1193. [2024-11-10 03:00:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1192 states have (on average 1.4890939597315436) internal successors, (1775), 1192 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1775 transitions. [2024-11-10 03:00:03,090 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1775 transitions. Word has length 97 [2024-11-10 03:00:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:03,091 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1775 transitions. [2024-11-10 03:00:03,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1775 transitions. [2024-11-10 03:00:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 03:00:03,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:03,093 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] [2024-11-10 03:00:03,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:00:03,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:03,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:03,094 INFO L85 PathProgramCache]: Analyzing trace with hash -130329488, now seen corresponding path program 1 times [2024-11-10 03:00:03,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:03,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567536062] [2024-11-10 03:00:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:03,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:03,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-10 03:00:03,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:03,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567536062] [2024-11-10 03:00:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567536062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:03,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:03,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:00:03,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328098259] [2024-11-10 03:00:03,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:03,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:00:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:03,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:00:03,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:00:03,598 INFO L87 Difference]: Start difference. First operand 1193 states and 1775 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:04,345 INFO L93 Difference]: Finished difference Result 2242 states and 3340 transitions. [2024-11-10 03:00:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:00:04,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-10 03:00:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:04,351 INFO L225 Difference]: With dead ends: 2242 [2024-11-10 03:00:04,351 INFO L226 Difference]: Without dead ends: 1193 [2024-11-10 03:00:04,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-10 03:00:04,355 INFO L432 NwaCegarLoop]: 1390 mSDtfsCounter, 1738 mSDsluCounter, 2777 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 4167 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:04,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 4167 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 03:00:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-10 03:00:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1178. [2024-11-10 03:00:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.4893797790994052) internal successors, (1753), 1177 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1753 transitions. [2024-11-10 03:00:04,386 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1753 transitions. Word has length 97 [2024-11-10 03:00:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:04,386 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1753 transitions. [2024-11-10 03:00:04,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1753 transitions. [2024-11-10 03:00:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 03:00:04,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:04,388 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] [2024-11-10 03:00:04,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:00:04,389 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:04,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1412563518, now seen corresponding path program 1 times [2024-11-10 03:00:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873148250] [2024-11-10 03:00:04,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:05,973 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-10 03:00:05,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:05,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873148250] [2024-11-10 03:00:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873148250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:05,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 03:00:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716117933] [2024-11-10 03:00:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:05,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 03:00:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:05,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 03:00:05,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:00:05,976 INFO L87 Difference]: Start difference. First operand 1178 states and 1753 transitions. Second operand has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:07,544 INFO L93 Difference]: Finished difference Result 2234 states and 3329 transitions. [2024-11-10 03:00:07,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 03:00:07,544 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-10 03:00:07,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:07,549 INFO L225 Difference]: With dead ends: 2234 [2024-11-10 03:00:07,550 INFO L226 Difference]: Without dead ends: 1200 [2024-11-10 03:00:07,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2024-11-10 03:00:07,553 INFO L432 NwaCegarLoop]: 1379 mSDtfsCounter, 1753 mSDsluCounter, 7079 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 8458 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:07,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 8458 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2033 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 03:00:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-11-10 03:00:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1185. [2024-11-10 03:00:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.4890202702702702) internal successors, (1763), 1184 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1763 transitions. [2024-11-10 03:00:07,577 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1763 transitions. Word has length 98 [2024-11-10 03:00:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:07,577 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1763 transitions. [2024-11-10 03:00:07,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1763 transitions. [2024-11-10 03:00:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 03:00:07,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:07,579 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] [2024-11-10 03:00:07,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 03:00:07,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1231540440, now seen corresponding path program 1 times [2024-11-10 03:00:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:07,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142345492] [2024-11-10 03:00:07,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:08,120 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-10 03:00:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142345492] [2024-11-10 03:00:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142345492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:00:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218120725] [2024-11-10 03:00:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:08,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:00:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:00:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:00:08,124 INFO L87 Difference]: Start difference. First operand 1185 states and 1763 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:09,023 INFO L93 Difference]: Finished difference Result 2237 states and 3331 transitions. [2024-11-10 03:00:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:00:09,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-10 03:00:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:09,030 INFO L225 Difference]: With dead ends: 2237 [2024-11-10 03:00:09,030 INFO L226 Difference]: Without dead ends: 1200 [2024-11-10 03:00:09,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:00:09,033 INFO L432 NwaCegarLoop]: 1387 mSDtfsCounter, 1722 mSDsluCounter, 5543 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 6930 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:09,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1722 Valid, 6930 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 03:00:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-11-10 03:00:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1191. [2024-11-10 03:00:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1190 states have (on average 1.4857142857142858) internal successors, (1768), 1190 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1768 transitions. [2024-11-10 03:00:09,060 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1768 transitions. Word has length 99 [2024-11-10 03:00:09,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:09,060 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1768 transitions. [2024-11-10 03:00:09,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1768 transitions. [2024-11-10 03:00:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 03:00:09,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:09,062 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] [2024-11-10 03:00:09,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 03:00:09,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:09,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:09,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1246214688, now seen corresponding path program 1 times [2024-11-10 03:00:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:09,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919862240] [2024-11-10 03:00:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:09,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-10 03:00:09,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919862240] [2024-11-10 03:00:09,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919862240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:09,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:09,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:00:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6898296] [2024-11-10 03:00:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:09,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:00:09,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:09,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:00:09,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:00:09,495 INFO L87 Difference]: Start difference. First operand 1191 states and 1768 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:10,163 INFO L93 Difference]: Finished difference Result 2230 states and 3318 transitions. [2024-11-10 03:00:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:00:10,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-10 03:00:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:10,167 INFO L225 Difference]: With dead ends: 2230 [2024-11-10 03:00:10,168 INFO L226 Difference]: Without dead ends: 1190 [2024-11-10 03:00:10,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-10 03:00:10,170 INFO L432 NwaCegarLoop]: 1389 mSDtfsCounter, 1708 mSDsluCounter, 2775 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 4164 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:10,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 4164 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 03:00:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-10 03:00:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1185. [2024-11-10 03:00:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.4864864864864864) internal successors, (1760), 1184 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1760 transitions. [2024-11-10 03:00:10,192 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1760 transitions. Word has length 99 [2024-11-10 03:00:10,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:10,193 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1760 transitions. [2024-11-10 03:00:10,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1760 transitions. [2024-11-10 03:00:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 03:00:10,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:10,194 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] [2024-11-10 03:00:10,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 03:00:10,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:10,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:10,195 INFO L85 PathProgramCache]: Analyzing trace with hash 912103161, now seen corresponding path program 1 times [2024-11-10 03:00:10,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:10,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367697001] [2024-11-10 03:00:10,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:10,980 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-10 03:00:10,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:10,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367697001] [2024-11-10 03:00:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367697001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:10,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:10,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 03:00:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068587141] [2024-11-10 03:00:10,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:10,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:00:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:10,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:00:10,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:00:10,983 INFO L87 Difference]: Start difference. First operand 1185 states and 1760 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:11,953 INFO L93 Difference]: Finished difference Result 2224 states and 3310 transitions. [2024-11-10 03:00:11,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:00:11,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-10 03:00:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:11,958 INFO L225 Difference]: With dead ends: 2224 [2024-11-10 03:00:11,958 INFO L226 Difference]: Without dead ends: 1190 [2024-11-10 03:00:11,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:00:11,961 INFO L432 NwaCegarLoop]: 1384 mSDtfsCounter, 1699 mSDsluCounter, 4237 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 5621 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:11,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 5621 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 03:00:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-10 03:00:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1187. [2024-11-10 03:00:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 1.4856661045531196) internal successors, (1762), 1186 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1762 transitions. [2024-11-10 03:00:11,983 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1762 transitions. Word has length 100 [2024-11-10 03:00:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:11,983 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1762 transitions. [2024-11-10 03:00:11,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1762 transitions. [2024-11-10 03:00:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 03:00:11,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:11,985 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] [2024-11-10 03:00:11,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 03:00:11,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1265401704, now seen corresponding path program 1 times [2024-11-10 03:00:11,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:11,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281565663] [2024-11-10 03:00:11,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:11,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:12,565 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-10 03:00:12,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:12,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281565663] [2024-11-10 03:00:12,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281565663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:12,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:12,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:00:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515975946] [2024-11-10 03:00:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:12,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:00:12,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:12,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:00:12,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:00:12,567 INFO L87 Difference]: Start difference. First operand 1187 states and 1762 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:13,447 INFO L93 Difference]: Finished difference Result 2228 states and 3315 transitions. [2024-11-10 03:00:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:00:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-10 03:00:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:13,453 INFO L225 Difference]: With dead ends: 2228 [2024-11-10 03:00:13,453 INFO L226 Difference]: Without dead ends: 1194 [2024-11-10 03:00:13,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:00:13,456 INFO L432 NwaCegarLoop]: 1387 mSDtfsCounter, 1701 mSDsluCounter, 4187 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 5574 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:13,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 5574 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 03:00:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-10 03:00:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1190. [2024-11-10 03:00:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 1.4852817493692179) internal successors, (1766), 1189 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1766 transitions. [2024-11-10 03:00:13,480 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1766 transitions. Word has length 101 [2024-11-10 03:00:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:13,481 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1766 transitions. [2024-11-10 03:00:13,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1766 transitions. [2024-11-10 03:00:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 03:00:13,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:13,483 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] [2024-11-10 03:00:13,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 03:00:13,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:13,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:13,484 INFO L85 PathProgramCache]: Analyzing trace with hash 644110120, now seen corresponding path program 1 times [2024-11-10 03:00:13,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:13,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551668205] [2024-11-10 03:00:13,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:13,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:14,568 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-10 03:00:14,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:14,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551668205] [2024-11-10 03:00:14,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551668205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:14,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:14,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-10 03:00:14,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713638415] [2024-11-10 03:00:14,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:14,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 03:00:14,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:14,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 03:00:14,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-10 03:00:14,570 INFO L87 Difference]: Start difference. First operand 1190 states and 1766 transitions. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:17,040 INFO L93 Difference]: Finished difference Result 2254 states and 3354 transitions. [2024-11-10 03:00:17,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 03:00:17,040 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-10 03:00:17,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:17,045 INFO L225 Difference]: With dead ends: 2254 [2024-11-10 03:00:17,046 INFO L226 Difference]: Without dead ends: 1220 [2024-11-10 03:00:17,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-10 03:00:17,049 INFO L432 NwaCegarLoop]: 1389 mSDtfsCounter, 1652 mSDsluCounter, 22175 mSDsCounter, 0 mSdLazyCounter, 5425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 23564 SdHoareTripleChecker+Invalid, 5426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:17,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 23564 Invalid, 5426 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 5425 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 03:00:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2024-11-10 03:00:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1210. [2024-11-10 03:00:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1209 states have (on average 1.488006617038875) internal successors, (1799), 1209 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1799 transitions. [2024-11-10 03:00:17,076 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1799 transitions. Word has length 101 [2024-11-10 03:00:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:17,077 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1799 transitions. [2024-11-10 03:00:17,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1799 transitions. [2024-11-10 03:00:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 03:00:17,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:17,078 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] [2024-11-10 03:00:17,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 03:00:17,078 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:17,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1818533172, now seen corresponding path program 1 times [2024-11-10 03:00:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:17,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633779341] [2024-11-10 03:00:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:00:18,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:18,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633779341] [2024-11-10 03:00:18,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633779341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:18,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:18,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:00:18,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620103522] [2024-11-10 03:00:18,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:18,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:00:18,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:18,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:00:18,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:00:18,159 INFO L87 Difference]: Start difference. First operand 1210 states and 1799 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:19,202 INFO L93 Difference]: Finished difference Result 3162 states and 4707 transitions. [2024-11-10 03:00:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:00:19,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-11-10 03:00:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:19,209 INFO L225 Difference]: With dead ends: 3162 [2024-11-10 03:00:19,209 INFO L226 Difference]: Without dead ends: 2081 [2024-11-10 03:00:19,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:00:19,212 INFO L432 NwaCegarLoop]: 1380 mSDtfsCounter, 4289 mSDsluCounter, 5515 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4289 SdHoareTripleChecker+Valid, 6895 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:19,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4289 Valid, 6895 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 03:00:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2024-11-10 03:00:19,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 1212. [2024-11-10 03:00:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 1.486374896779521) internal successors, (1800), 1211 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1800 transitions. [2024-11-10 03:00:19,244 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1800 transitions. Word has length 102 [2024-11-10 03:00:19,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:19,245 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1800 transitions. [2024-11-10 03:00:19,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1800 transitions. [2024-11-10 03:00:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 03:00:19,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:19,246 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] [2024-11-10 03:00:19,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 03:00:19,247 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:19,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash -317994286, now seen corresponding path program 1 times [2024-11-10 03:00:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:19,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755072981] [2024-11-10 03:00:19,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:19,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:19,767 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-10 03:00:19,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:19,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755072981] [2024-11-10 03:00:19,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755072981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:19,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:19,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:00:19,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109083170] [2024-11-10 03:00:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:19,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:00:19,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:19,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:00:19,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:00:19,771 INFO L87 Difference]: Start difference. First operand 1212 states and 1800 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:20,725 INFO L93 Difference]: Finished difference Result 3156 states and 4696 transitions. [2024-11-10 03:00:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:00:20,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-10 03:00:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:20,731 INFO L225 Difference]: With dead ends: 3156 [2024-11-10 03:00:20,731 INFO L226 Difference]: Without dead ends: 2083 [2024-11-10 03:00:20,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:00:20,733 INFO L432 NwaCegarLoop]: 1383 mSDtfsCounter, 4289 mSDsluCounter, 4936 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4289 SdHoareTripleChecker+Valid, 6319 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:20,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4289 Valid, 6319 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 03:00:20,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2024-11-10 03:00:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1214. [2024-11-10 03:00:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.4855729596042868) internal successors, (1802), 1213 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1802 transitions. [2024-11-10 03:00:20,756 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1802 transitions. Word has length 103 [2024-11-10 03:00:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:20,757 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1802 transitions. [2024-11-10 03:00:20,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1802 transitions. [2024-11-10 03:00:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 03:00:20,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:20,758 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] [2024-11-10 03:00:20,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 03:00:20,759 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:20,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash -662431265, now seen corresponding path program 1 times [2024-11-10 03:00:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:20,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344274045] [2024-11-10 03:00:20,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:21,205 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-10 03:00:21,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:00:21,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344274045] [2024-11-10 03:00:21,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344274045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:21,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:21,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:00:21,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654827086] [2024-11-10 03:00:21,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:21,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:00:21,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:00:21,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:00:21,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:00:21,208 INFO L87 Difference]: Start difference. First operand 1214 states and 1802 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:21,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:21,886 INFO L93 Difference]: Finished difference Result 3158 states and 4698 transitions. [2024-11-10 03:00:21,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:00:21,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-11-10 03:00:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:21,891 INFO L225 Difference]: With dead ends: 3158 [2024-11-10 03:00:21,891 INFO L226 Difference]: Without dead ends: 2080 [2024-11-10 03:00:21,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-10 03:00:21,894 INFO L432 NwaCegarLoop]: 1383 mSDtfsCounter, 4275 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4275 SdHoareTripleChecker+Valid, 4148 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:21,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4275 Valid, 4148 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 03:00:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2024-11-10 03:00:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1213. [2024-11-10 03:00:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 1.4851485148514851) internal successors, (1800), 1212 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1800 transitions. [2024-11-10 03:00:21,924 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1800 transitions. Word has length 104 [2024-11-10 03:00:21,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:21,924 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1800 transitions. [2024-11-10 03:00:21,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1800 transitions. [2024-11-10 03:00:21,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 03:00:21,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:21,926 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] [2024-11-10 03:00:21,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 03:00:21,926 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:21,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash 254250447, now seen corresponding path program 1 times [2024-11-10 03:00:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:00:21,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076332876] [2024-11-10 03:00:21,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:00:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:00:22,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:00:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:00:22,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:00:22,204 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:00:22,205 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:00:22,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 03:00:22,210 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:22,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:00:22,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:00:22 BoogieIcfgContainer [2024-11-10 03:00:22,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:00:22,327 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:00:22,327 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:00:22,328 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:00:22,328 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:59:50" (3/4) ... [2024-11-10 03:00:22,331 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:00:22,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:00:22,333 INFO L158 Benchmark]: Toolchain (without parser) took 38837.24ms. Allocated memory was 180.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 106.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 292.3MB. Max. memory is 16.1GB. [2024-11-10 03:00:22,333 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:00:22,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 984.05ms. Allocated memory is still 180.4MB. Free memory was 105.9MB in the beginning and 66.9MB in the end (delta: 39.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 03:00:22,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 623.35ms. Allocated memory was 180.4MB in the beginning and 182.5MB in the end (delta: 2.1MB). Free memory was 66.9MB in the beginning and 82.4MB in the end (delta: -15.6MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. [2024-11-10 03:00:22,334 INFO L158 Benchmark]: Boogie Preprocessor took 539.57ms. Allocated memory was 182.5MB in the beginning and 360.7MB in the end (delta: 178.3MB). Free memory was 82.4MB in the beginning and 226.5MB in the end (delta: -144.1MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-10 03:00:22,335 INFO L158 Benchmark]: IcfgBuilder took 4806.29ms. Allocated memory was 360.7MB in the beginning and 622.9MB in the end (delta: 262.1MB). Free memory was 226.5MB in the beginning and 439.8MB in the end (delta: -213.3MB). Peak memory consumption was 264.1MB. Max. memory is 16.1GB. [2024-11-10 03:00:22,335 INFO L158 Benchmark]: TraceAbstraction took 31869.66ms. Allocated memory was 622.9MB in the beginning and 1.5GB in the end (delta: 910.2MB). Free memory was 438.7MB in the beginning and 1.2GB in the end (delta: -731.6MB). Peak memory consumption was 177.5MB. Max. memory is 16.1GB. [2024-11-10 03:00:22,335 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 1.5GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:00:22,339 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 984.05ms. Allocated memory is still 180.4MB. Free memory was 105.9MB in the beginning and 66.9MB in the end (delta: 39.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 623.35ms. Allocated memory was 180.4MB in the beginning and 182.5MB in the end (delta: 2.1MB). Free memory was 66.9MB in the beginning and 82.4MB in the end (delta: -15.6MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 539.57ms. Allocated memory was 182.5MB in the beginning and 360.7MB in the end (delta: 178.3MB). Free memory was 82.4MB in the beginning and 226.5MB in the end (delta: -144.1MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * IcfgBuilder took 4806.29ms. Allocated memory was 360.7MB in the beginning and 622.9MB in the end (delta: 262.1MB). Free memory was 226.5MB in the beginning and 439.8MB in the end (delta: -213.3MB). Peak memory consumption was 264.1MB. Max. memory is 16.1GB. * TraceAbstraction took 31869.66ms. Allocated memory was 622.9MB in the beginning and 1.5GB in the end (delta: 910.2MB). Free memory was 438.7MB in the beginning and 1.2GB in the end (delta: -731.6MB). Peak memory consumption was 177.5MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 1.5GB. Free memory is still 1.2GB. 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 bitwiseAnd at line 409. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_26 = 2; [L46] const SORT_21 var_29 = 4; [L47] const SORT_21 var_33 = 8; [L48] const SORT_21 var_37 = 0; [L49] const SORT_21 var_46 = 16; [L50] const SORT_21 var_49 = 32; [L51] const SORT_21 var_52 = 64; [L52] const SORT_3 var_57 = 1; [L53] const SORT_3 var_61 = 0; [L54] const SORT_6 var_146 = 0; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_368; [L72] SORT_3 input_390; [L73] SORT_3 input_405; [L74] SORT_3 input_420; [L75] SORT_3 input_435; [L76] SORT_3 input_450; [L77] SORT_3 input_465; [L78] SORT_3 input_480; [L79] SORT_3 input_495; [L80] SORT_3 input_510; [L81] SORT_3 input_525; [L82] SORT_3 input_540; [L83] SORT_3 input_555; [L84] SORT_3 input_570; [L85] SORT_3 input_585; [L86] SORT_3 input_600; [L87] SORT_3 input_616; [L88] SORT_3 input_618; [L89] SORT_3 input_620; [L90] SORT_3 input_622; [L91] SORT_3 input_624; [L92] SORT_3 input_626; [L93] SORT_3 input_628; [L94] SORT_3 input_630; [L95] SORT_3 input_635; [L96] SORT_21 input_676; [L97] SORT_21 input_677; [L98] SORT_21 input_678; [L99] SORT_21 input_679; [L100] SORT_21 input_682; [L101] SORT_21 input_686; [L102] SORT_21 input_690; [L103] SORT_21 input_698; [L104] SORT_21 input_702; [L105] SORT_21 input_704; [L106] SORT_21 input_708; [L107] SORT_21 input_711; [L108] SORT_21 input_715; [L109] SORT_21 input_720; [L110] SORT_21 input_724; [L111] SORT_21 input_729; [L112] SORT_21 input_731; [L113] SORT_21 input_732; [L114] SORT_21 input_734; [L115] SORT_21 input_738; [L116] SORT_21 input_743; [L117] SORT_21 input_750; [L118] SORT_21 input_751; [L119] SORT_21 input_753; [L120] SORT_21 input_757; [L121] SORT_21 input_762; [L122] SORT_21 input_764; [L123] SORT_21 input_765; [L124] SORT_21 input_767; [L125] SORT_21 input_771; [L126] SORT_21 input_776; [L127] SORT_21 input_780; [L128] SORT_21 input_785; [L129] SORT_21 input_787; [L130] SORT_21 input_793; [L131] SORT_21 input_805; [L132] SORT_3 input_810; [L133] SORT_3 input_819; [L134] SORT_3 input_838; [L135] SORT_3 input_845; [L136] SORT_3 input_856; [L137] SORT_3 input_862; [L138] SORT_3 input_868; [L139] SORT_3 input_874; [L140] SORT_3 input_880; [L141] SORT_3 input_886; [L142] SORT_3 input_892; [L143] SORT_3 input_898; [L144] SORT_3 input_904; [L145] SORT_3 input_910; [L146] SORT_3 input_916; [L147] SORT_3 input_922; [L148] SORT_3 input_928; [L150] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L151] SORT_21 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L152] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L152] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L153] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L153] SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L154] SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L155] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L155] SORT_3 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L156] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L156] SORT_3 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L157] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L157] SORT_3 state_78 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L158] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L158] SORT_3 state_94 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L159] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L159] SORT_3 state_111 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L160] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L160] SORT_3 state_114 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L161] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L161] SORT_3 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L162] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L162] SORT_3 state_120 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L163] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L163] SORT_3 state_124 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L164] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L164] SORT_3 state_129 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L165] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L165] SORT_3 state_132 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L166] SORT_3 state_142 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L167] SORT_3 state_149 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L168] SORT_3 state_152 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L169] SORT_3 state_161 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L170] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L170] SORT_3 state_166 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L171] SORT_3 state_169 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L172] SORT_3 state_181 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L173] SORT_3 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L174] SORT_3 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L175] SORT_3 state_199 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L176] SORT_3 state_208 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L177] SORT_3 state_221 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L178] SORT_3 state_234 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_21 init_32_arg_1 = var_22; [L183] state_31 = init_32_arg_1 [L184] SORT_3 init_63_arg_1 = var_61; [L185] state_62 = init_63_arg_1 [L186] SORT_3 init_65_arg_1 = var_61; [L187] state_64 = init_65_arg_1 [L188] SORT_3 init_67_arg_1 = var_61; [L189] state_66 = init_67_arg_1 [L190] SORT_3 init_71_arg_1 = var_61; [L191] state_70 = init_71_arg_1 [L192] SORT_3 init_75_arg_1 = var_61; [L193] state_74 = init_75_arg_1 [L194] SORT_3 init_79_arg_1 = var_61; [L195] state_78 = init_79_arg_1 [L196] SORT_3 init_95_arg_1 = var_61; [L197] state_94 = init_95_arg_1 [L198] SORT_3 init_112_arg_1 = var_61; [L199] state_111 = init_112_arg_1 [L200] SORT_3 init_115_arg_1 = var_61; [L201] state_114 = init_115_arg_1 [L202] SORT_3 init_117_arg_1 = var_61; [L203] state_116 = init_117_arg_1 [L204] SORT_3 init_121_arg_1 = var_61; [L205] state_120 = init_121_arg_1 [L206] SORT_3 init_125_arg_1 = var_61; [L207] state_124 = init_125_arg_1 [L208] SORT_3 init_130_arg_1 = var_61; [L209] state_129 = init_130_arg_1 [L210] SORT_3 init_133_arg_1 = var_61; [L211] state_132 = init_133_arg_1 [L212] SORT_3 init_143_arg_1 = var_61; [L213] state_142 = init_143_arg_1 [L214] SORT_3 init_150_arg_1 = var_61; [L215] state_149 = init_150_arg_1 [L216] SORT_3 init_153_arg_1 = var_61; [L217] state_152 = init_153_arg_1 [L218] SORT_3 init_162_arg_1 = var_61; [L219] state_161 = init_162_arg_1 [L220] SORT_3 init_167_arg_1 = var_61; [L221] state_166 = init_167_arg_1 [L222] SORT_3 init_170_arg_1 = var_61; [L223] state_169 = init_170_arg_1 [L224] SORT_3 init_182_arg_1 = var_61; [L225] state_181 = init_182_arg_1 [L226] SORT_3 init_192_arg_1 = var_61; [L227] state_191 = init_192_arg_1 [L228] SORT_3 init_197_arg_1 = var_61; [L229] state_196 = init_197_arg_1 [L230] SORT_3 init_200_arg_1 = var_61; [L231] state_199 = init_200_arg_1 [L232] SORT_3 init_209_arg_1 = var_61; [L233] state_208 = init_209_arg_1 [L234] SORT_3 init_222_arg_1 = var_61; [L235] state_221 = init_222_arg_1 [L236] SORT_3 init_235_arg_1 = var_61; [L237] state_234 = init_235_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_368 = __VERIFIER_nondet_uchar() [L257] input_390 = __VERIFIER_nondet_uchar() [L258] input_405 = __VERIFIER_nondet_uchar() [L259] input_420 = __VERIFIER_nondet_uchar() [L260] input_435 = __VERIFIER_nondet_uchar() [L261] input_450 = __VERIFIER_nondet_uchar() [L262] input_465 = __VERIFIER_nondet_uchar() [L263] input_480 = __VERIFIER_nondet_uchar() [L264] input_495 = __VERIFIER_nondet_uchar() [L265] input_510 = __VERIFIER_nondet_uchar() [L266] input_525 = __VERIFIER_nondet_uchar() [L267] input_540 = __VERIFIER_nondet_uchar() [L268] input_555 = __VERIFIER_nondet_uchar() [L269] input_570 = __VERIFIER_nondet_uchar() [L270] input_585 = __VERIFIER_nondet_uchar() [L271] input_600 = __VERIFIER_nondet_uchar() [L272] input_616 = __VERIFIER_nondet_uchar() [L273] input_618 = __VERIFIER_nondet_uchar() [L274] input_620 = __VERIFIER_nondet_uchar() [L275] input_622 = __VERIFIER_nondet_uchar() [L276] input_624 = __VERIFIER_nondet_uchar() [L277] input_626 = __VERIFIER_nondet_uchar() [L278] input_628 = __VERIFIER_nondet_uchar() [L279] input_630 = __VERIFIER_nondet_uchar() [L280] input_635 = __VERIFIER_nondet_uchar() [L281] input_676 = __VERIFIER_nondet_uchar() [L282] input_677 = __VERIFIER_nondet_uchar() [L283] input_678 = __VERIFIER_nondet_uchar() [L284] input_679 = __VERIFIER_nondet_uchar() [L285] input_682 = __VERIFIER_nondet_uchar() [L286] input_686 = __VERIFIER_nondet_uchar() [L287] input_690 = __VERIFIER_nondet_uchar() [L288] input_698 = __VERIFIER_nondet_uchar() [L289] input_702 = __VERIFIER_nondet_uchar() [L290] input_704 = __VERIFIER_nondet_uchar() [L291] input_708 = __VERIFIER_nondet_uchar() [L292] input_711 = __VERIFIER_nondet_uchar() [L293] input_715 = __VERIFIER_nondet_uchar() [L294] input_720 = __VERIFIER_nondet_uchar() [L295] input_724 = __VERIFIER_nondet_uchar() [L296] input_729 = __VERIFIER_nondet_uchar() [L297] input_731 = __VERIFIER_nondet_uchar() [L298] input_732 = __VERIFIER_nondet_uchar() [L299] input_734 = __VERIFIER_nondet_uchar() [L300] input_738 = __VERIFIER_nondet_uchar() [L301] input_743 = __VERIFIER_nondet_uchar() [L302] input_750 = __VERIFIER_nondet_uchar() [L303] input_751 = __VERIFIER_nondet_uchar() [L304] input_753 = __VERIFIER_nondet_uchar() [L305] input_757 = __VERIFIER_nondet_uchar() [L306] input_762 = __VERIFIER_nondet_uchar() [L307] input_764 = __VERIFIER_nondet_uchar() [L308] input_765 = __VERIFIER_nondet_uchar() [L309] input_767 = __VERIFIER_nondet_uchar() [L310] input_771 = __VERIFIER_nondet_uchar() [L311] input_776 = __VERIFIER_nondet_uchar() [L312] input_780 = __VERIFIER_nondet_uchar() [L313] input_785 = __VERIFIER_nondet_uchar() [L314] input_787 = __VERIFIER_nondet_uchar() [L315] input_793 = __VERIFIER_nondet_uchar() [L316] input_805 = __VERIFIER_nondet_uchar() [L317] input_810 = __VERIFIER_nondet_uchar() [L318] input_819 = __VERIFIER_nondet_uchar() [L319] input_838 = __VERIFIER_nondet_uchar() [L320] input_845 = __VERIFIER_nondet_uchar() [L321] input_856 = __VERIFIER_nondet_uchar() [L322] input_862 = __VERIFIER_nondet_uchar() [L323] input_868 = __VERIFIER_nondet_uchar() [L324] input_874 = __VERIFIER_nondet_uchar() [L325] input_880 = __VERIFIER_nondet_uchar() [L326] input_886 = __VERIFIER_nondet_uchar() [L327] input_892 = __VERIFIER_nondet_uchar() [L328] input_898 = __VERIFIER_nondet_uchar() [L329] input_904 = __VERIFIER_nondet_uchar() [L330] input_910 = __VERIFIER_nondet_uchar() [L331] input_916 = __VERIFIER_nondet_uchar() [L332] input_922 = __VERIFIER_nondet_uchar() [L333] input_928 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_27_arg_0 = state_23; [L340] SORT_21 var_27_arg_1 = var_26; [L341] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L342] SORT_3 var_28_arg_0 = var_25; [L343] SORT_3 var_28_arg_1 = var_27; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L344] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L344] SORT_3 var_28 = var_28_arg_0 | var_28_arg_1; [L345] SORT_21 var_30_arg_0 = state_23; [L346] SORT_21 var_30_arg_1 = var_29; [L347] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L348] SORT_21 var_34_arg_0 = state_31; [L349] SORT_21 var_34_arg_1 = var_33; [L350] SORT_3 var_34 = var_34_arg_0 == var_34_arg_1; [L351] SORT_21 var_35_arg_0 = state_31; [L352] SORT_21 var_35_arg_1 = var_22; [L353] SORT_3 var_35 = var_35_arg_0 == var_35_arg_1; [L354] SORT_3 var_36_arg_0 = var_34; [L355] SORT_3 var_36_arg_1 = var_35; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_36_arg_0=0, var_36_arg_1=1, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L356] EXPR var_36_arg_0 | var_36_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L356] SORT_3 var_36 = var_36_arg_0 | var_36_arg_1; [L357] SORT_21 var_38_arg_0 = state_31; [L358] SORT_21 var_38_arg_1 = var_37; [L359] SORT_3 var_38 = var_38_arg_0 == var_38_arg_1; [L360] SORT_3 var_39_arg_0 = var_36; [L361] SORT_3 var_39_arg_1 = var_38; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_39_arg_0=1, var_39_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L362] EXPR var_39_arg_0 | var_39_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L362] SORT_3 var_39 = var_39_arg_0 | var_39_arg_1; [L363] SORT_21 var_40_arg_0 = state_31; [L364] SORT_21 var_40_arg_1 = var_29; [L365] SORT_3 var_40 = var_40_arg_0 == var_40_arg_1; [L366] SORT_3 var_41_arg_0 = var_39; [L367] SORT_3 var_41_arg_1 = var_40; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_41_arg_0=1, var_41_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L368] EXPR var_41_arg_0 | var_41_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L368] SORT_3 var_41 = var_41_arg_0 | var_41_arg_1; [L369] SORT_3 var_42_arg_0 = var_30; [L370] SORT_3 var_42_arg_1 = var_41; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_33=8, var_37=0, var_42_arg_0=0, var_42_arg_1=1, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L371] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L371] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_28; [L373] SORT_3 var_43_arg_1 = var_42; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_43_arg_0=1, var_43_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L374] EXPR var_43_arg_0 | var_43_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L374] SORT_3 var_43 = var_43_arg_0 | var_43_arg_1; [L375] SORT_21 var_44_arg_0 = state_23; [L376] SORT_21 var_44_arg_1 = var_33; [L377] SORT_3 var_44 = var_44_arg_0 == var_44_arg_1; [L378] SORT_3 var_45_arg_0 = var_43; [L379] SORT_3 var_45_arg_1 = var_44; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_45_arg_0=1, var_45_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L380] EXPR var_45_arg_0 | var_45_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L380] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L381] SORT_21 var_47_arg_0 = state_23; [L382] SORT_21 var_47_arg_1 = var_46; [L383] SORT_3 var_47 = var_47_arg_0 == var_47_arg_1; [L384] SORT_3 var_48_arg_0 = var_45; [L385] SORT_3 var_48_arg_1 = var_47; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_48_arg_0=1, var_48_arg_1=0, var_49=32, var_52=64, var_57=1, var_61=0] [L386] EXPR var_48_arg_0 | var_48_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L386] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L387] SORT_21 var_50_arg_0 = state_23; [L388] SORT_21 var_50_arg_1 = var_49; [L389] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L390] SORT_3 var_51_arg_0 = var_48; [L391] SORT_3 var_51_arg_1 = var_50; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_51_arg_0=1, var_51_arg_1=0, var_52=64, var_57=1, var_61=0] [L392] EXPR var_51_arg_0 | var_51_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L392] SORT_3 var_51 = var_51_arg_0 | var_51_arg_1; [L393] SORT_21 var_53_arg_0 = state_23; [L394] SORT_21 var_53_arg_1 = var_52; [L395] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L396] SORT_3 var_54_arg_0 = var_51; [L397] SORT_3 var_54_arg_1 = var_53; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_54_arg_0=1, var_54_arg_1=0, var_57=1, var_61=0] [L398] EXPR var_54_arg_0 | var_54_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L398] SORT_3 var_54 = var_54_arg_0 | var_54_arg_1; [L399] SORT_21 var_55_arg_0 = state_23; [L400] SORT_21 var_55_arg_1 = var_37; [L401] SORT_3 var_55 = var_55_arg_0 == var_55_arg_1; [L402] SORT_3 var_56_arg_0 = var_54; [L403] SORT_3 var_56_arg_1 = var_55; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_56_arg_0=1, var_56_arg_1=0, var_57=1, var_61=0] [L404] EXPR var_56_arg_0 | var_56_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L404] SORT_3 var_56 = var_56_arg_0 | var_56_arg_1; [L405] SORT_3 var_58_arg_0 = var_56; [L406] SORT_3 var_58 = ~var_58_arg_0; [L407] SORT_3 var_59_arg_0 = var_57; [L408] SORT_3 var_59_arg_1 = var_58; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_59_arg_0=1, var_59_arg_1=-2, var_61=0] [L409] EXPR var_59_arg_0 & var_59_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L409] SORT_3 var_59 = var_59_arg_0 & var_59_arg_1; [L410] EXPR var_59 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0] [L410] var_59 = var_59 & mask_SORT_3 [L411] SORT_3 bad_60_arg_0 = var_59; [L412] CALL __VERIFIER_assert(!(bad_60_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1133 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31776 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31776 mSDsluCounter, 113698 SdHoareTripleChecker+Invalid, 12.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90073 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25152 IncrementalHoareTripleChecker+Invalid, 25162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 23625 mSDtfsCounter, 25152 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1214occurred in iteration=16, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 2756 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 1772 NumberOfCodeBlocks, 1772 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1651 ConstructedInterpolants, 0 QuantifiedInterpolants, 8277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-10 03:00:22,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.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 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:00:24,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:00:24,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 03:00:24,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:00:24,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:00:24,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:00:24,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:00:24,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:00:24,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:00:24,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:00:24,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:00:24,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:00:24,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:00:24,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:00:24,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:00:24,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:00:24,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:00:24,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:00:24,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:00:24,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:00:24,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:00:24,989 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:00:24,989 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:00:24,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:00:24,990 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:00:24,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:00:24,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:00:24,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:00:24,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:00:24,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:00:24,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:00:24,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:00:24,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:00:24,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:00:24,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:00:24,995 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:00:24,995 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:00:24,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:00:24,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:00:24,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:00:24,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:00:24,997 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 -> 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f [2024-11-10 03:00:25,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:00:25,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:00:25,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:00:25,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:00:25,417 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:00:25,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-11-10 03:00:26,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:00:27,366 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:00:27,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-11-10 03:00:27,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c16f912/0b613ac35ca84970916d8aa465d2feea/FLAG2ae04a007 [2024-11-10 03:00:27,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c16f912/0b613ac35ca84970916d8aa465d2feea [2024-11-10 03:00:27,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:00:27,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:00:27,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:00:27,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:00:27,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:00:27,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:00:27" (1/1) ... [2024-11-10 03:00:27,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a91ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:27, skipping insertion in model container [2024-11-10 03:00:27,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:00:27" (1/1) ... [2024-11-10 03:00:27,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:00:27,760 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2024-11-10 03:00:28,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:00:28,190 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:00:28,201 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281] [2024-11-10 03:00:28,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:00:28,385 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:00:28,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28 WrapperNode [2024-11-10 03:00:28,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:00:28,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:00:28,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:00:28,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:00:28,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,598 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2640 [2024-11-10 03:00:28,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:00:28,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:00:28,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:00:28,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:00:28,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,710 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-10 03:00:28,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,766 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:00:28,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:00:28,822 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:00:28,822 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:00:28,823 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (1/1) ... [2024-11-10 03:00:28,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:00:28,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:00:28,858 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-10 03:00:28,860 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-10 03:00:28,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:00:28,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:00:28,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:00:28,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:00:29,346 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:00:29,349 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:00:32,839 INFO L? ?]: Removed 183 outVars from TransFormulas that were not future-live. [2024-11-10 03:00:32,840 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:00:32,852 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:00:32,852 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:00:32,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:00:32 BoogieIcfgContainer [2024-11-10 03:00:32,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:00:32,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:00:32,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:00:32,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:00:32,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:00:27" (1/3) ... [2024-11-10 03:00:32,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaf38fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:00:32, skipping insertion in model container [2024-11-10 03:00:32,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:00:28" (2/3) ... [2024-11-10 03:00:32,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaf38fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:00:32, skipping insertion in model container [2024-11-10 03:00:32,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:00:32" (3/3) ... [2024-11-10 03:00:32,863 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-11-10 03:00:32,882 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:00:32,883 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:00:32,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:00:32,947 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;@657b8748, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:00:32,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:00:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 03:00:32,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:32,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 03:00:32,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:32,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 03:00:32,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:00:32,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469001587] [2024-11-10 03:00:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:32,984 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-10 03:00:32,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:00:32,987 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-10 03:00:32,989 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-10 03:00:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:33,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 03:00:33,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:00:33,830 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-10 03:00:33,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:00:33,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:00:33,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469001587] [2024-11-10 03:00:33,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469001587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:00:33,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:00:33,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:00:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746130311] [2024-11-10 03:00:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:00:33,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:00:33,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:00:33,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:00:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:00:33,869 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:33,963 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-10 03:00:33,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:00:33,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 03:00:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:33,971 INFO L225 Difference]: With dead ends: 21 [2024-11-10 03:00:33,972 INFO L226 Difference]: Without dead ends: 10 [2024-11-10 03:00:33,974 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-10 03:00:33,977 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:33,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:00:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-10 03:00:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-10 03:00:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 03:00:34,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 03:00:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:34,003 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 03:00:34,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 03:00:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 03:00:34,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:34,004 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:00:34,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:00:34,205 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-10 03:00:34,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:34,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 03:00:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:00:34,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469857540] [2024-11-10 03:00:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:00:34,208 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-10 03:00:34,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:00:34,227 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-10 03:00:34,229 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-10 03:00:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:00:35,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 03:00:35,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:00:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:00:35,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:00:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:00:39,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:00:39,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469857540] [2024-11-10 03:00:39,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469857540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:00:39,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:00:39,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 03:00:39,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474100878] [2024-11-10 03:00:39,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:00:39,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:00:39,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:00:39,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:00:39,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-11-10 03:00:39,686 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:00:39,917 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-10 03:00:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:00:39,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 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 9 [2024-11-10 03:00:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:00:39,918 INFO L225 Difference]: With dead ends: 16 [2024-11-10 03:00:39,919 INFO L226 Difference]: Without dead ends: 13 [2024-11-10 03:00:39,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2024-11-10 03:00:39,921 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:00:39,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:00:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-10 03:00:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-10 03:00:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-10 03:00:39,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-10 03:00:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:00:39,929 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-10 03:00:39,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:00:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-10 03:00:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 03:00:39,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:00:39,931 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 03:00:39,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 03:00:40,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:00:40,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:00:40,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:00:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-10 03:00:40,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:00:40,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933887794] [2024-11-10 03:00:40,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 03:00:40,136 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-10 03:00:40,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:00:40,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:00:40,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:00:41,353 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 03:00:41,354 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 03:00:41,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-10 03:00:41,405 INFO L278 TraceCheckSpWp]: Computing forward predicates...