./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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-?-c7c6ca5-m [2024-11-08 19:13:33,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:13:33,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 19:13:33,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:13:33,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:13:33,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:13:33,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:13:33,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:13:33,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:13:33,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:13:33,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:13:33,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:13:33,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:13:33,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:13:33,811 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:13:33,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:13:33,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:13:33,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:13:33,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:13:33,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:13:33,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:13:33,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:13:33,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:13:33,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:13:33,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:13:33,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:13:33,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:13:33,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:13:33,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:13:33,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:33,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:13:33,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:13:33,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:13:33,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:13:33,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:13:33,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:13:33,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:13:33,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:13:33,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:13:33,823 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-08 19:13:34,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:13:34,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:13:34,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:13:34,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:13:34,142 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:13:34,143 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-08 19:13:35,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:13:35,874 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:13:35,874 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-08 19:13:35,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b15506ad/95b45ba07e9647faa7ad07d6c6ccc0fe/FLAG129e8c05e [2024-11-08 19:13:35,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b15506ad/95b45ba07e9647faa7ad07d6c6ccc0fe [2024-11-08 19:13:35,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:13:35,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:13:35,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:35,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:13:35,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:13:35,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:35" (1/1) ... [2024-11-08 19:13:35,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc35b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:35, skipping insertion in model container [2024-11-08 19:13:35,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:35" (1/1) ... [2024-11-08 19:13:35,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:13:36,276 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-08 19:13:36,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:36,743 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:13:36,752 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-08 19:13:36,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:36,959 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:13:36,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36 WrapperNode [2024-11-08 19:13:36,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:36,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:36,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:13:36,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:13:36,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,746 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4881 [2024-11-08 19:13:37,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:37,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:13:37,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:13:37,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:13:37,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:37,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:38,092 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:13:38,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:38,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:38,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:38,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:38,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:38,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:38,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:13:38,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:13:38,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:13:38,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:13:38,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (1/1) ... [2024-11-08 19:13:38,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:38,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:13:38,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:13:38,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:13:38,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:13:38,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:13:38,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:13:38,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:13:39,246 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:13:39,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:13:43,342 INFO L? ?]: Removed 3163 outVars from TransFormulas that were not future-live. [2024-11-08 19:13:43,343 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:13:43,391 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:13:43,392 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:13:43,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:43 BoogieIcfgContainer [2024-11-08 19:13:43,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:13:43,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:13:43,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:13:43,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:13:43,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:13:35" (1/3) ... [2024-11-08 19:13:43,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17033dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:43, skipping insertion in model container [2024-11-08 19:13:43,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:36" (2/3) ... [2024-11-08 19:13:43,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17033dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:43, skipping insertion in model container [2024-11-08 19:13:43,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:43" (3/3) ... [2024-11-08 19:13:43,403 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-11-08 19:13:43,420 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:13:43,421 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:13:43,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:13:43,524 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;@ddc557d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:13:43,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:13:43,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 1130 states, 1128 states have (on average 1.499113475177305) internal successors, (1691), 1129 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 19:13:43,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:43,542 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] [2024-11-08 19:13:43,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:43,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:43,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1233996024, now seen corresponding path program 1 times [2024-11-08 19:13:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521935818] [2024-11-08 19:13:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:43,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:44,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521935818] [2024-11-08 19:13:44,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521935818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:44,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:44,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:13:44,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95081052] [2024-11-08 19:13:44,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:44,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:44,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:44,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:44,687 INFO L87 Difference]: Start difference. First operand has 1130 states, 1128 states have (on average 1.499113475177305) internal successors, (1691), 1129 states have internal predecessors, (1691), 0 states have call successors, (0), 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 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:44,861 INFO L93 Difference]: Finished difference Result 2141 states and 3207 transitions. [2024-11-08 19:13:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:13:44,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-08 19:13:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:44,882 INFO L225 Difference]: With dead ends: 2141 [2024-11-08 19:13:44,882 INFO L226 Difference]: Without dead ends: 1129 [2024-11-08 19:13:44,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:44,895 INFO L432 NwaCegarLoop]: 1685 mSDtfsCounter, 0 mSDsluCounter, 3364 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5049 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:44,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5049 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:13:44,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2024-11-08 19:13:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2024-11-08 19:13:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 1.497340425531915) internal successors, (1689), 1128 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1689 transitions. [2024-11-08 19:13:44,994 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1689 transitions. Word has length 91 [2024-11-08 19:13:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:44,996 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1689 transitions. [2024-11-08 19:13:44,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1689 transitions. [2024-11-08 19:13:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 19:13:45,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:45,003 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-08 19:13:45,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:13:45,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:45,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash 402524632, now seen corresponding path program 1 times [2024-11-08 19:13:45,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:45,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405295655] [2024-11-08 19:13:45,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:45,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405295655] [2024-11-08 19:13:45,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405295655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:45,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:45,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:13:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703801700] [2024-11-08 19:13:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:45,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:45,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:45,422 INFO L87 Difference]: Start difference. First operand 1129 states and 1689 transitions. 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-08 19:13:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:45,493 INFO L93 Difference]: Finished difference Result 2142 states and 3205 transitions. [2024-11-08 19:13:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:13:45,494 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-08 19:13:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:45,501 INFO L225 Difference]: With dead ends: 2142 [2024-11-08 19:13:45,502 INFO L226 Difference]: Without dead ends: 1131 [2024-11-08 19:13:45,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:45,506 INFO L432 NwaCegarLoop]: 1685 mSDtfsCounter, 0 mSDsluCounter, 3360 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5045 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:45,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5045 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:13:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2024-11-08 19:13:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1131. [2024-11-08 19:13:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1130 states have (on average 1.4964601769911505) internal successors, (1691), 1130 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1691 transitions. [2024-11-08 19:13:45,540 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1691 transitions. Word has length 92 [2024-11-08 19:13:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:45,541 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1691 transitions. [2024-11-08 19:13:45,541 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-08 19:13:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1691 transitions. [2024-11-08 19:13:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 19:13:45,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:45,543 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-08 19:13:45,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:13:45,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:45,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1504603679, now seen corresponding path program 1 times [2024-11-08 19:13:45,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157770924] [2024-11-08 19:13:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:46,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:46,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157770924] [2024-11-08 19:13:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157770924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:46,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:46,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:13:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466707084] [2024-11-08 19:13:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:46,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:13:46,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:46,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:13:46,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:13:46,195 INFO L87 Difference]: Start difference. First operand 1131 states and 1691 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-08 19:13:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:46,320 INFO L93 Difference]: Finished difference Result 2148 states and 3212 transitions. [2024-11-08 19:13:46,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:13:46,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-08 19:13:46,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:46,327 INFO L225 Difference]: With dead ends: 2148 [2024-11-08 19:13:46,327 INFO L226 Difference]: Without dead ends: 1135 [2024-11-08 19:13:46,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:46,330 INFO L432 NwaCegarLoop]: 1677 mSDtfsCounter, 1610 mSDsluCounter, 5022 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 6699 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:46,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 6699 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-11-08 19:13:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1134. [2024-11-08 19:13:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1133 states have (on average 1.4951456310679612) internal successors, (1694), 1133 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-08 19:13:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1694 transitions. [2024-11-08 19:13:46,357 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1694 transitions. Word has length 93 [2024-11-08 19:13:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:46,358 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1694 transitions. [2024-11-08 19:13:46,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-08 19:13:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1694 transitions. [2024-11-08 19:13:46,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 19:13:46,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:46,362 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-08 19:13:46,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:13:46,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:46,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2128495429, now seen corresponding path program 1 times [2024-11-08 19:13:46,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:46,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879746600] [2024-11-08 19:13:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:46,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:47,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:47,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879746600] [2024-11-08 19:13:47,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879746600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:47,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:47,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:13:47,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572161770] [2024-11-08 19:13:47,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:47,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:13:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:47,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:13:47,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:13:47,459 INFO L87 Difference]: Start difference. First operand 1134 states and 1694 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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-08 19:13:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:47,626 INFO L93 Difference]: Finished difference Result 2195 states and 3279 transitions. [2024-11-08 19:13:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:47,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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-08 19:13:47,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:47,632 INFO L225 Difference]: With dead ends: 2195 [2024-11-08 19:13:47,633 INFO L226 Difference]: Without dead ends: 1179 [2024-11-08 19:13:47,634 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-08 19:13:47,635 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 1756 mSDsluCounter, 3333 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 5000 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:47,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 5000 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-11-08 19:13:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1140. [2024-11-08 19:13:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 1.4942932396839332) internal successors, (1702), 1139 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1702 transitions. [2024-11-08 19:13:47,662 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1702 transitions. Word has length 94 [2024-11-08 19:13:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:47,662 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1702 transitions. [2024-11-08 19:13:47,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 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-08 19:13:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1702 transitions. [2024-11-08 19:13:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 19:13:47,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:47,664 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-08 19:13:47,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:13:47,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:47,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1037528425, now seen corresponding path program 1 times [2024-11-08 19:13:47,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:47,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970812221] [2024-11-08 19:13:47,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:48,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:48,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970812221] [2024-11-08 19:13:48,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970812221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:48,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:48,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 19:13:48,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251729563] [2024-11-08 19:13:48,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:48,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:13:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:13:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:13:48,449 INFO L87 Difference]: Start difference. First operand 1140 states and 1702 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-08 19:13:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:48,576 INFO L93 Difference]: Finished difference Result 2176 states and 3250 transitions. [2024-11-08 19:13:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:13:48,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-08 19:13:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:48,583 INFO L225 Difference]: With dead ends: 2176 [2024-11-08 19:13:48,584 INFO L226 Difference]: Without dead ends: 1160 [2024-11-08 19:13:48,585 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-08 19:13:48,586 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 19 mSDsluCounter, 6724 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 8403 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:48,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 8403 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-11-08 19:13:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1157. [2024-11-08 19:13:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4930795847750864) internal successors, (1726), 1156 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1726 transitions. [2024-11-08 19:13:48,616 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1726 transitions. Word has length 95 [2024-11-08 19:13:48,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:48,617 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1726 transitions. [2024-11-08 19:13:48,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-08 19:13:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1726 transitions. [2024-11-08 19:13:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 19:13:48,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:48,619 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-08 19:13:48,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:13:48,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:48,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1847090050, now seen corresponding path program 1 times [2024-11-08 19:13:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:48,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976192841] [2024-11-08 19:13:48,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:48,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:49,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976192841] [2024-11-08 19:13:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976192841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:49,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:49,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:13:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638847902] [2024-11-08 19:13:49,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:49,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:13:49,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:49,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:13:49,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:13:49,712 INFO L87 Difference]: Start difference. First operand 1157 states and 1726 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 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-08 19:13:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:50,133 INFO L93 Difference]: Finished difference Result 2256 states and 3365 transitions. [2024-11-08 19:13:50,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:13:50,134 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 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-08 19:13:50,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:50,139 INFO L225 Difference]: With dead ends: 2256 [2024-11-08 19:13:50,139 INFO L226 Difference]: Without dead ends: 1223 [2024-11-08 19:13:50,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-08 19:13:50,142 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 1831 mSDsluCounter, 9993 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1831 SdHoareTripleChecker+Valid, 11651 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:50,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1831 Valid, 11651 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:13:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-11-08 19:13:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1182. [2024-11-08 19:13:50,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.491955969517358) internal successors, (1762), 1181 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-08 19:13:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1762 transitions. [2024-11-08 19:13:50,167 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1762 transitions. Word has length 96 [2024-11-08 19:13:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:50,168 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1762 transitions. [2024-11-08 19:13:50,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 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-08 19:13:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1762 transitions. [2024-11-08 19:13:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 19:13:50,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:50,172 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-08 19:13:50,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:13:50,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:50,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash -524889858, now seen corresponding path program 1 times [2024-11-08 19:13:50,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:50,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718754104] [2024-11-08 19:13:50,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:50,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718754104] [2024-11-08 19:13:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718754104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:50,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:50,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:13:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002335960] [2024-11-08 19:13:50,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:50,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:13:50,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:50,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:13:50,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:13:50,807 INFO L87 Difference]: Start difference. First operand 1182 states and 1762 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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-08 19:13:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:50,959 INFO L93 Difference]: Finished difference Result 2233 states and 3330 transitions. [2024-11-08 19:13:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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-08 19:13:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:50,964 INFO L225 Difference]: With dead ends: 2233 [2024-11-08 19:13:50,964 INFO L226 Difference]: Without dead ends: 1200 [2024-11-08 19:13:50,966 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-08 19:13:50,967 INFO L432 NwaCegarLoop]: 1669 mSDtfsCounter, 1753 mSDsluCounter, 3334 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 5003 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:50,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 5003 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-11-08 19:13:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1182. [2024-11-08 19:13:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.4911092294665538) internal successors, (1761), 1181 states have internal predecessors, (1761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1761 transitions. [2024-11-08 19:13:50,993 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1761 transitions. Word has length 96 [2024-11-08 19:13:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:50,993 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1761 transitions. [2024-11-08 19:13:50,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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-08 19:13:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1761 transitions. [2024-11-08 19:13:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 19:13:50,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:50,995 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-08 19:13:50,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:13:50,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:50,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1987657310, now seen corresponding path program 1 times [2024-11-08 19:13:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:50,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243079786] [2024-11-08 19:13:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:52,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:52,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243079786] [2024-11-08 19:13:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243079786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:52,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:52,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 19:13:52,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296117943] [2024-11-08 19:13:52,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:52,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:13:52,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:52,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:13:52,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:13:52,060 INFO L87 Difference]: Start difference. First operand 1182 states and 1761 transitions. Second operand has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 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-08 19:13:52,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:52,615 INFO L93 Difference]: Finished difference Result 2239 states and 3338 transitions. [2024-11-08 19:13:52,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 19:13:52,616 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 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-08 19:13:52,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:52,621 INFO L225 Difference]: With dead ends: 2239 [2024-11-08 19:13:52,621 INFO L226 Difference]: Without dead ends: 1206 [2024-11-08 19:13:52,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-11-08 19:13:52,625 INFO L432 NwaCegarLoop]: 1656 mSDtfsCounter, 1757 mSDsluCounter, 14894 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 16550 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:52,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 16550 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:13:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2024-11-08 19:13:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1185. [2024-11-08 19:13:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.4907094594594594) internal successors, (1765), 1184 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1765 transitions. [2024-11-08 19:13:52,650 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1765 transitions. Word has length 97 [2024-11-08 19:13:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:52,650 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1765 transitions. [2024-11-08 19:13:52,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 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-08 19:13:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1765 transitions. [2024-11-08 19:13:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 19:13:52,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:52,652 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-08 19:13:52,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:13:52,652 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1017783003, now seen corresponding path program 1 times [2024-11-08 19:13:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557279993] [2024-11-08 19:13:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:53,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-08 19:13:53,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:53,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557279993] [2024-11-08 19:13:53,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557279993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:53,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:13:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434990131] [2024-11-08 19:13:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:53,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:13:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:13:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:53,321 INFO L87 Difference]: Start difference. First operand 1185 states and 1765 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 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-08 19:13:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:53,564 INFO L93 Difference]: Finished difference Result 2240 states and 3339 transitions. [2024-11-08 19:13:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:13:53,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 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-08 19:13:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:53,570 INFO L225 Difference]: With dead ends: 2240 [2024-11-08 19:13:53,571 INFO L226 Difference]: Without dead ends: 1207 [2024-11-08 19:13:53,574 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-08 19:13:53,574 INFO L432 NwaCegarLoop]: 1664 mSDtfsCounter, 1745 mSDsluCounter, 6651 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 8315 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:53,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 8315 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:53,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2024-11-08 19:13:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1195. [2024-11-08 19:13:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1194 states have (on average 1.4899497487437185) internal successors, (1779), 1194 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1779 transitions. [2024-11-08 19:13:53,602 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1779 transitions. Word has length 98 [2024-11-08 19:13:53,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:53,603 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1779 transitions. [2024-11-08 19:13:53,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 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-08 19:13:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1779 transitions. [2024-11-08 19:13:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 19:13:53,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:53,605 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-08 19:13:53,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:13:53,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:53,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:53,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1927674431, now seen corresponding path program 1 times [2024-11-08 19:13:53,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:53,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667487019] [2024-11-08 19:13:53,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:53,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:54,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:54,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667487019] [2024-11-08 19:13:54,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667487019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:54,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:54,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:13:54,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426470213] [2024-11-08 19:13:54,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:54,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:13:54,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:54,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:13:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:13:54,022 INFO L87 Difference]: Start difference. First operand 1195 states and 1779 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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-08 19:13:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:54,174 INFO L93 Difference]: Finished difference Result 2243 states and 3342 transitions. [2024-11-08 19:13:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:54,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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-08 19:13:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:54,179 INFO L225 Difference]: With dead ends: 2243 [2024-11-08 19:13:54,179 INFO L226 Difference]: Without dead ends: 1204 [2024-11-08 19:13:54,181 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-08 19:13:54,181 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 1735 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 4999 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:54,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 4999 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:54,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2024-11-08 19:13:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1194. [2024-11-08 19:13:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1193 states have (on average 1.4886839899413244) internal successors, (1776), 1193 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1776 transitions. [2024-11-08 19:13:54,204 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1776 transitions. Word has length 98 [2024-11-08 19:13:54,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:54,204 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1776 transitions. [2024-11-08 19:13:54,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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-08 19:13:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1776 transitions. [2024-11-08 19:13:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 19:13:54,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:54,205 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-08 19:13:54,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 19:13:54,206 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:54,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:54,206 INFO L85 PathProgramCache]: Analyzing trace with hash -874954566, now seen corresponding path program 1 times [2024-11-08 19:13:54,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:54,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22207553] [2024-11-08 19:13:54,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:54,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:54,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22207553] [2024-11-08 19:13:54,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22207553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:54,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:54,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:13:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348793506] [2024-11-08 19:13:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:54,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:13:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:13:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:54,698 INFO L87 Difference]: Start difference. First operand 1194 states and 1776 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 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-08 19:13:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:54,916 INFO L93 Difference]: Finished difference Result 2245 states and 3341 transitions. [2024-11-08 19:13:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:13:54,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 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-08 19:13:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:54,921 INFO L225 Difference]: With dead ends: 2245 [2024-11-08 19:13:54,921 INFO L226 Difference]: Without dead ends: 1193 [2024-11-08 19:13:54,923 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-08 19:13:54,923 INFO L432 NwaCegarLoop]: 1668 mSDtfsCounter, 1740 mSDsluCounter, 6659 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 8327 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:54,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 8327 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-08 19:13:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1183. [2024-11-08 19:13:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.488155668358714) internal successors, (1759), 1182 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1759 transitions. [2024-11-08 19:13:54,942 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1759 transitions. Word has length 98 [2024-11-08 19:13:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:54,942 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1759 transitions. [2024-11-08 19:13:54,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 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-08 19:13:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1759 transitions. [2024-11-08 19:13:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:13:54,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:54,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:54,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 19:13:54,944 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:54,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash 67809601, now seen corresponding path program 1 times [2024-11-08 19:13:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632555547] [2024-11-08 19:13:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:54,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:55,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:55,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632555547] [2024-11-08 19:13:55,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632555547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:55,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:55,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:13:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459622867] [2024-11-08 19:13:55,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:55,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:13:55,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:55,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:13:55,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:13:55,368 INFO L87 Difference]: Start difference. First operand 1183 states and 1759 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-08 19:13:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:55,518 INFO L93 Difference]: Finished difference Result 2223 states and 3311 transitions. [2024-11-08 19:13:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:55,519 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-08 19:13:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:55,523 INFO L225 Difference]: With dead ends: 2223 [2024-11-08 19:13:55,523 INFO L226 Difference]: Without dead ends: 1190 [2024-11-08 19:13:55,525 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-08 19:13:55,525 INFO L432 NwaCegarLoop]: 1668 mSDtfsCounter, 1708 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 5000 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:55,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 5000 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-08 19:13:55,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1183. [2024-11-08 19:13:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.4873096446700507) internal successors, (1758), 1182 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1758 transitions. [2024-11-08 19:13:55,547 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1758 transitions. Word has length 99 [2024-11-08 19:13:55,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:55,547 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1758 transitions. [2024-11-08 19:13:55,547 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-08 19:13:55,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1758 transitions. [2024-11-08 19:13:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:13:55,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:55,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:55,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 19:13:55,549 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:55,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:55,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1163727269, now seen corresponding path program 1 times [2024-11-08 19:13:55,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:55,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811186237] [2024-11-08 19:13:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:56,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:56,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811186237] [2024-11-08 19:13:56,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811186237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:56,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:56,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:13:56,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985873410] [2024-11-08 19:13:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:56,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:13:56,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:56,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:13:56,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:56,076 INFO L87 Difference]: Start difference. First operand 1183 states and 1758 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-08 19:13:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:56,276 INFO L93 Difference]: Finished difference Result 2227 states and 3316 transitions. [2024-11-08 19:13:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:13:56,276 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-08 19:13:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:56,280 INFO L225 Difference]: With dead ends: 2227 [2024-11-08 19:13:56,280 INFO L226 Difference]: Without dead ends: 1194 [2024-11-08 19:13:56,282 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-08 19:13:56,283 INFO L432 NwaCegarLoop]: 1663 mSDtfsCounter, 1715 mSDsluCounter, 3400 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 5063 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:56,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 5063 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-08 19:13:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1186. [2024-11-08 19:13:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1185 states have (on average 1.4869198312236287) internal successors, (1762), 1185 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-08 19:13:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1762 transitions. [2024-11-08 19:13:56,305 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1762 transitions. Word has length 99 [2024-11-08 19:13:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:56,305 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1762 transitions. [2024-11-08 19:13:56,305 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-08 19:13:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1762 transitions. [2024-11-08 19:13:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 19:13:56,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:56,306 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-08 19:13:56,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 19:13:56,307 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:56,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:56,307 INFO L85 PathProgramCache]: Analyzing trace with hash 340120908, now seen corresponding path program 1 times [2024-11-08 19:13:56,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:56,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213286992] [2024-11-08 19:13:56,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:56,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:57,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:57,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213286992] [2024-11-08 19:13:57,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213286992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:57,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:13:57,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406199497] [2024-11-08 19:13:57,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:57,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:13:57,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:13:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:13:57,177 INFO L87 Difference]: Start difference. First operand 1186 states and 1762 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 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-08 19:13:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:57,408 INFO L93 Difference]: Finished difference Result 2229 states and 3318 transitions. [2024-11-08 19:13:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:13:57,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 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-08 19:13:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:57,414 INFO L225 Difference]: With dead ends: 2229 [2024-11-08 19:13:57,414 INFO L226 Difference]: Without dead ends: 1196 [2024-11-08 19:13:57,416 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-08 19:13:57,416 INFO L432 NwaCegarLoop]: 1664 mSDtfsCounter, 1707 mSDsluCounter, 5024 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 6688 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:57,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 6688 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2024-11-08 19:13:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1192. [2024-11-08 19:13:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1191 states have (on average 1.486146095717884) internal successors, (1770), 1191 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-08 19:13:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1770 transitions. [2024-11-08 19:13:57,443 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1770 transitions. Word has length 100 [2024-11-08 19:13:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:57,443 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1770 transitions. [2024-11-08 19:13:57,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 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-08 19:13:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1770 transitions. [2024-11-08 19:13:57,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 19:13:57,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:57,445 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-08 19:13:57,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 19:13:57,445 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:57,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash -315537392, now seen corresponding path program 1 times [2024-11-08 19:13:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748242222] [2024-11-08 19:13:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:57,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:58,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:58,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748242222] [2024-11-08 19:13:58,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748242222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:58,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:58,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 19:13:58,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395443537] [2024-11-08 19:13:58,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:58,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 19:13:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:58,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 19:13:58,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:13:58,583 INFO L87 Difference]: Start difference. First operand 1192 states and 1770 transitions. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 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-08 19:13:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:59,232 INFO L93 Difference]: Finished difference Result 2258 states and 3361 transitions. [2024-11-08 19:13:59,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 19:13:59,233 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 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-08 19:13:59,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:59,237 INFO L225 Difference]: With dead ends: 2258 [2024-11-08 19:13:59,237 INFO L226 Difference]: Without dead ends: 1225 [2024-11-08 19:13:59,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:13:59,241 INFO L432 NwaCegarLoop]: 1666 mSDtfsCounter, 1651 mSDsluCounter, 26591 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 28257 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:59,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 28257 Invalid, 741 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 19:13:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-08 19:13:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1215. [2024-11-08 19:13:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1214 states have (on average 1.4884678747940692) internal successors, (1807), 1214 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1807 transitions. [2024-11-08 19:13:59,263 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1807 transitions. Word has length 100 [2024-11-08 19:13:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:59,263 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1807 transitions. [2024-11-08 19:13:59,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 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-08 19:13:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1807 transitions. [2024-11-08 19:13:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 19:13:59,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:59,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:59,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 19:13:59,265 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:59,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash 298757096, now seen corresponding path program 1 times [2024-11-08 19:13:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:59,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240682474] [2024-11-08 19:13:59,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:59,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:13:59,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:59,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240682474] [2024-11-08 19:13:59,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240682474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:59,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:59,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:13:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588900701] [2024-11-08 19:13:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:59,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:13:59,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:59,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:13:59,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:13:59,717 INFO L87 Difference]: Start difference. First operand 1215 states and 1807 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 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-08 19:13:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:59,862 INFO L93 Difference]: Finished difference Result 2270 states and 3384 transitions. [2024-11-08 19:13:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:59,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 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-08 19:13:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:59,866 INFO L225 Difference]: With dead ends: 2270 [2024-11-08 19:13:59,866 INFO L226 Difference]: Without dead ends: 1211 [2024-11-08 19:13:59,868 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-08 19:13:59,868 INFO L432 NwaCegarLoop]: 1668 mSDtfsCounter, 1699 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 5000 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:59,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 5000 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:13:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-11-08 19:13:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1209. [2024-11-08 19:13:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.4884105960264902) internal successors, (1798), 1208 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:13:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1798 transitions. [2024-11-08 19:13:59,888 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1798 transitions. Word has length 100 [2024-11-08 19:13:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:59,888 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1798 transitions. [2024-11-08 19:13:59,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 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-08 19:13:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1798 transitions. [2024-11-08 19:13:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 19:13:59,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:59,890 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-08 19:13:59,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 19:13:59,890 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:59,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash 372821100, now seen corresponding path program 1 times [2024-11-08 19:13:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:59,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473403341] [2024-11-08 19:13:59,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:59,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:00,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:00,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473403341] [2024-11-08 19:14:00,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473403341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:00,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:00,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:14:00,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52152019] [2024-11-08 19:14:00,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:00,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:14:00,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:00,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:14:00,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:14:00,707 INFO L87 Difference]: Start difference. First operand 1209 states and 1798 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-08 19:14:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:01,006 INFO L93 Difference]: Finished difference Result 3158 states and 4703 transitions. [2024-11-08 19:14:01,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:14:01,007 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-08 19:14:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:01,013 INFO L225 Difference]: With dead ends: 3158 [2024-11-08 19:14:01,013 INFO L226 Difference]: Without dead ends: 2078 [2024-11-08 19:14:01,015 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-08 19:14:01,015 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 4281 mSDsluCounter, 6629 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4281 SdHoareTripleChecker+Valid, 8288 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:01,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4281 Valid, 8288 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:14:01,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2024-11-08 19:14:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1212. [2024-11-08 19:14:01,035 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-08 19:14:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1800 transitions. [2024-11-08 19:14:01,038 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1800 transitions. Word has length 101 [2024-11-08 19:14:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:01,038 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1800 transitions. [2024-11-08 19:14:01,038 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-08 19:14:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1800 transitions. [2024-11-08 19:14:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 19:14:01,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:01,039 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-08 19:14:01,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 19:14:01,040 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:01,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash 167212702, now seen corresponding path program 1 times [2024-11-08 19:14:01,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:01,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019669265] [2024-11-08 19:14:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:01,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:01,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019669265] [2024-11-08 19:14:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019669265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:01,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:14:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970098816] [2024-11-08 19:14:01,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:01,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:14:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:01,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:14:01,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:14:01,735 INFO L87 Difference]: Start difference. First operand 1212 states and 1800 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-08 19:14:02,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:02,033 INFO L93 Difference]: Finished difference Result 3154 states and 4694 transitions. [2024-11-08 19:14:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:14:02,034 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-08 19:14:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:02,041 INFO L225 Difference]: With dead ends: 3154 [2024-11-08 19:14:02,041 INFO L226 Difference]: Without dead ends: 2082 [2024-11-08 19:14:02,043 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-08 19:14:02,044 INFO L432 NwaCegarLoop]: 1660 mSDtfsCounter, 4286 mSDsluCounter, 5922 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4286 SdHoareTripleChecker+Valid, 7582 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:02,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4286 Valid, 7582 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:14:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2024-11-08 19:14:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1214. [2024-11-08 19:14:02,069 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-08 19:14:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1802 transitions. [2024-11-08 19:14:02,072 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1802 transitions. Word has length 102 [2024-11-08 19:14:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:02,074 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1802 transitions. [2024-11-08 19:14:02,075 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-08 19:14:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1802 transitions. [2024-11-08 19:14:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 19:14:02,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:02,076 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-08 19:14:02,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 19:14:02,076 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:02,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:02,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1702732013, now seen corresponding path program 1 times [2024-11-08 19:14:02,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:02,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336462083] [2024-11-08 19:14:02,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:02,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:14:02,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:14:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:14:02,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:14:02,311 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:14:02,313 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:14:02,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 19:14:02,317 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:02,428 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:14:02,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:14:02 BoogieIcfgContainer [2024-11-08 19:14:02,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:14:02,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:14:02,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:14:02,434 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:14:02,435 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:43" (3/4) ... [2024-11-08 19:14:02,437 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:14:02,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:14:02,439 INFO L158 Benchmark]: Toolchain (without parser) took 26524.43ms. Allocated memory was 155.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 96.0MB in the beginning and 944.8MB in the end (delta: -848.8MB). Peak memory consumption was 512.8MB. Max. memory is 16.1GB. [2024-11-08 19:14:02,439 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:14:02,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1040.97ms. Allocated memory was 155.2MB in the beginning and 232.8MB in the end (delta: 77.6MB). Free memory was 95.7MB in the beginning and 132.1MB in the end (delta: -36.3MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2024-11-08 19:14:02,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 786.23ms. Allocated memory is still 232.8MB. Free memory was 132.1MB in the beginning and 115.5MB in the end (delta: 16.5MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. [2024-11-08 19:14:02,440 INFO L158 Benchmark]: Boogie Preprocessor took 914.83ms. Allocated memory was 232.8MB in the beginning and 471.9MB in the end (delta: 239.1MB). Free memory was 115.5MB in the beginning and 332.9MB in the end (delta: -217.4MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2024-11-08 19:14:02,440 INFO L158 Benchmark]: RCFGBuilder took 4729.46ms. Allocated memory was 471.9MB in the beginning and 813.7MB in the end (delta: 341.8MB). Free memory was 332.9MB in the beginning and 433.4MB in the end (delta: -100.5MB). Peak memory consumption was 245.6MB. Max. memory is 16.1GB. [2024-11-08 19:14:02,441 INFO L158 Benchmark]: TraceAbstraction took 19038.67ms. Allocated memory was 813.7MB in the beginning and 1.5GB in the end (delta: 702.5MB). Free memory was 432.4MB in the beginning and 944.8MB in the end (delta: -512.4MB). Peak memory consumption was 190.1MB. Max. memory is 16.1GB. [2024-11-08 19:14:02,444 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 1.5GB. Free memory is still 944.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:14:02,445 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.21ms. Allocated memory is still 155.2MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1040.97ms. Allocated memory was 155.2MB in the beginning and 232.8MB in the end (delta: 77.6MB). Free memory was 95.7MB in the beginning and 132.1MB in the end (delta: -36.3MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 786.23ms. Allocated memory is still 232.8MB. Free memory was 132.1MB in the beginning and 115.5MB in the end (delta: 16.5MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 914.83ms. Allocated memory was 232.8MB in the beginning and 471.9MB in the end (delta: 239.1MB). Free memory was 115.5MB in the beginning and 332.9MB in the end (delta: -217.4MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * RCFGBuilder took 4729.46ms. Allocated memory was 471.9MB in the beginning and 813.7MB in the end (delta: 341.8MB). Free memory was 332.9MB in the beginning and 433.4MB in the end (delta: -100.5MB). Peak memory consumption was 245.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19038.67ms. Allocated memory was 813.7MB in the beginning and 1.5GB in the end (delta: 702.5MB). Free memory was 432.4MB in the beginning and 944.8MB in the end (delta: -512.4MB). Peak memory consumption was 190.1MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 1.5GB. Free memory is still 944.8MB. 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, 1130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30993 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30993 mSDsluCounter, 150919 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120896 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2417 IncrementalHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 30023 mSDtfsCounter, 2417 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1215occurred in iteration=15, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 1920 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 1852 NumberOfCodeBlocks, 1852 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1731 ConstructedInterpolants, 0 QuantifiedInterpolants, 8953 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 19:14:02,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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-?-c7c6ca5-m [2024-11-08 19:14:04,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:14:04,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 19:14:04,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:14:04,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:14:04,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:14:04,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:14:04,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:14:04,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:14:04,894 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:14:04,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:14:04,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:14:04,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:14:04,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:14:04,896 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:14:04,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:14:04,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:14:04,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:14:04,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:14:04,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:14:04,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:14:04,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:14:04,904 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:14:04,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:14:04,904 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:14:04,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:14:04,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:14:04,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:14:04,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:14:04,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:14:04,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:14:04,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:14:04,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:14:04,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:14:04,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:14:04,907 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:14:04,910 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:14:04,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:14:04,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:14:04,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:14:04,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:14:04,911 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-08 19:14:05,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:14:05,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:14:05,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:14:05,276 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:14:05,277 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:14:05,278 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-08 19:14:06,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:14:07,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:14:07,255 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-08 19:14:07,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde4ef6e2/5aa2ea4df88349209e4e4b500ff936d6/FLAG06d44e29c [2024-11-08 19:14:07,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde4ef6e2/5aa2ea4df88349209e4e4b500ff936d6 [2024-11-08 19:14:07,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:14:07,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:14:07,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:14:07,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:14:07,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:14:07,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:14:07" (1/1) ... [2024-11-08 19:14:07,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea8fba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:07, skipping insertion in model container [2024-11-08 19:14:07,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:14:07" (1/1) ... [2024-11-08 19:14:07,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:14:07,603 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-08 19:14:07,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:14:07,956 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:14:07,967 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-08 19:14:08,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:14:08,184 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:14:08,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08 WrapperNode [2024-11-08 19:14:08,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:14:08,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:14:08,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:14:08,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:14:08,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,364 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2641 [2024-11-08 19:14:08,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:14:08,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:14:08,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:14:08,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:14:08,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,493 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:14:08,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:14:08,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:14:08,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:14:08,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:14:08,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (1/1) ... [2024-11-08 19:14:08,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:14:08,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:14:08,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:14:08,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:14:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:14:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:14:08,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:14:08,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:14:09,185 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:14:09,187 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:14:12,164 INFO L? ?]: Removed 183 outVars from TransFormulas that were not future-live. [2024-11-08 19:14:12,165 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:14:12,176 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:14:12,178 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:14:12,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:14:12 BoogieIcfgContainer [2024-11-08 19:14:12,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:14:12,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:14:12,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:14:12,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:14:12,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:14:07" (1/3) ... [2024-11-08 19:14:12,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9d4e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:14:12, skipping insertion in model container [2024-11-08 19:14:12,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:08" (2/3) ... [2024-11-08 19:14:12,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9d4e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:14:12, skipping insertion in model container [2024-11-08 19:14:12,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:14:12" (3/3) ... [2024-11-08 19:14:12,186 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c [2024-11-08 19:14:12,206 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:14:12,206 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:14:12,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:14:12,261 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;@10930709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:14:12,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:14:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:14:12,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:12,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 19:14:12,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:12,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:12,276 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 19:14:12,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:14:12,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971878315] [2024-11-08 19:14:12,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:12,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:14:12,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:14:12,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:14:12,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:14:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:12,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 19:14:12,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:14:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:13,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:14:13,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:14:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971878315] [2024-11-08 19:14:13,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971878315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:13,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:13,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:14:13,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159100336] [2024-11-08 19:14:13,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:14:13,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:14:13,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:14:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:14:13,096 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:13,193 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-08 19:14:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:14:13,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-08 19:14:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:13,203 INFO L225 Difference]: With dead ends: 17 [2024-11-08 19:14:13,203 INFO L226 Difference]: Without dead ends: 9 [2024-11-08 19:14:13,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:14:13,210 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:13,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:14:13,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-08 19:14:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-08 19:14:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 19:14:13,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 19:14:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:13,239 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 19:14:13,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 19:14:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:14:13,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:13,240 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:13,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:14:13,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:14:13,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:13,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:13,442 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 19:14:13,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:14:13,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809316876] [2024-11-08 19:14:13,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:13,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:14:13,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:14:13,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:14:13,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:14:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 19:14:14,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:14:14,554 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-08 19:14:14,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:14:18,885 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-08 19:14:18,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:14:18,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809316876] [2024-11-08 19:14:18,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809316876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:14:18,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:14:18,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 19:14:18,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318998687] [2024-11-08 19:14:18,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:14:18,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:14:18,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:14:18,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:14:18,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-11-08 19:14:18,890 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-08 19:14:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:19,097 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-08 19:14:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:14:19,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) Word has length 8 [2024-11-08 19:14:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:19,098 INFO L225 Difference]: With dead ends: 14 [2024-11-08 19:14:19,098 INFO L226 Difference]: Without dead ends: 12 [2024-11-08 19:14:19,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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-08 19:14:19,100 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:19,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:14:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-08 19:14:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-08 19:14:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-08 19:14:19,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-08 19:14:19,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:19,104 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-08 19:14:19,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-08 19:14:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-08 19:14:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:14:19,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:19,106 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-08 19:14:19,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:14:19,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:14:19,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:19,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-08 19:14:19,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:14:19,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886942079] [2024-11-08 19:14:19,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 19:14:19,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:14:19,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:14:19,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:14:19,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:14:20,539 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 19:14:20,539 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 19:14:20,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-08 19:14:20,590 INFO L278 TraceCheckSpWp]: Computing forward predicates...