./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 8c68e7f909dde8700553fab87bbeaa91d2497338979474d785c0ae04bfaf91cb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:59:48,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:59:48,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:59:48,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:59:48,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:59:48,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:59:48,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:59:48,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:59:48,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:59:48,846 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:59:48,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:59:48,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:59:48,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:59:48,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:59:48,848 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:59:48,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:59:48,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:59:48,849 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:59:48,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:59:48,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:59:48,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:59:48,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:59:48,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:59:48,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:59:48,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:59:48,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:59:48,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:59:48,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:59:48,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:59:48,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:59:48,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:59:48,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:59:48,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:59:48,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:59:48,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:59:48,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:59:48,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:59:48,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:59:48,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:59:48,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:59:48,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:59:48,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:59:48,866 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c68e7f909dde8700553fab87bbeaa91d2497338979474d785c0ae04bfaf91cb [2024-10-24 10:59:49,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:59:49,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:59:49,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:59:49,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:59:49,149 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:59:49,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i [2024-10-24 10:59:50,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:59:50,878 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:59:50,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i [2024-10-24 10:59:50,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30401747/968bfb7cba224d9e8f863d7095da8b0b/FLAG472e1c930 [2024-10-24 10:59:50,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30401747/968bfb7cba224d9e8f863d7095da8b0b [2024-10-24 10:59:50,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:59:50,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:59:50,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:59:50,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:59:50,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:59:50,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:59:50" (1/1) ... [2024-10-24 10:59:50,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39023b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:50, skipping insertion in model container [2024-10-24 10:59:50,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:59:50" (1/1) ... [2024-10-24 10:59:50,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:59:51,115 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i[915,928] [2024-10-24 10:59:51,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:59:51,214 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:59:51,226 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i[915,928] [2024-10-24 10:59:51,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:59:51,296 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:59:51,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51 WrapperNode [2024-10-24 10:59:51,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:59:51,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:59:51,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:59:51,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:59:51,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,356 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-24 10:59:51,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:59:51,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:59:51,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:59:51,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:59:51,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,403 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:59:51,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,413 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:59:51,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:59:51,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:59:51,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:59:51,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (1/1) ... [2024-10-24 10:59:51,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:59:51,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:59:51,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:59:51,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:59:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:59:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:59:51,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:59:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:59:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:59:51,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:59:51,590 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:59:51,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:59:52,044 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-24 10:59:52,044 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:59:52,083 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:59:52,083 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:59:52,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:59:52 BoogieIcfgContainer [2024-10-24 10:59:52,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:59:52,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:59:52,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:59:52,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:59:52,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:59:50" (1/3) ... [2024-10-24 10:59:52,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfa864f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:59:52, skipping insertion in model container [2024-10-24 10:59:52,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:59:51" (2/3) ... [2024-10-24 10:59:52,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfa864f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:59:52, skipping insertion in model container [2024-10-24 10:59:52,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:59:52" (3/3) ... [2024-10-24 10:59:52,092 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-84.i [2024-10-24 10:59:52,106 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:59:52,106 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:59:52,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:59:52,172 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;@6b4863b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:59:52,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:59:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 10:59:52,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 10:59:52,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:59:52,194 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:59:52,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:59:52,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:59:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash 313342948, now seen corresponding path program 1 times [2024-10-24 10:59:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:59:52,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417552904] [2024-10-24 10:59:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:59:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:59:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:59:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:59:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:59:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:59:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:59:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:59:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:59:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:59:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 10:59:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:59:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 10:59:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 10:59:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 10:59:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 10:59:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 10:59:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 10:59:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 10:59:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 10:59:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 10:59:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 10:59:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 10:59:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 10:59:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 10:59:52,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:59:52,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417552904] [2024-10-24 10:59:52,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417552904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:59:52,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:59:52,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:59:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199492324] [2024-10-24 10:59:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:59:52,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:59:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:59:52,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:59:52,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:59:52,755 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 10:59:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:59:52,803 INFO L93 Difference]: Finished difference Result 147 states and 254 transitions. [2024-10-24 10:59:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:59:52,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2024-10-24 10:59:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:59:52,815 INFO L225 Difference]: With dead ends: 147 [2024-10-24 10:59:52,816 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 10:59:52,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:59:52,825 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:59:52,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:59:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 10:59:52,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 10:59:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 10:59:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-10-24 10:59:52,887 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 141 [2024-10-24 10:59:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:59:52,890 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-10-24 10:59:52,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 10:59:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-10-24 10:59:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 10:59:52,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:59:52,896 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:59:52,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:59:52,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:59:52,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:59:52,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1808792156, now seen corresponding path program 1 times [2024-10-24 10:59:52,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:59:52,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209074209] [2024-10-24 10:59:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:59:52,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:59:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:59:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:59:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:59:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:59:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:59:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:59:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:59:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:59:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 10:59:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:59:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 10:59:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 10:59:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 10:59:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 10:59:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 10:59:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 10:59:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 10:59:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 10:59:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 10:59:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 10:59:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 10:59:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 10:59:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 10:59:53,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:59:53,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209074209] [2024-10-24 10:59:53,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209074209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:59:53,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:59:53,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:59:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476667298] [2024-10-24 10:59:53,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:59:53,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:59:53,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:59:53,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:59:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:59:53,452 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:59:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:59:53,483 INFO L93 Difference]: Finished difference Result 145 states and 223 transitions. [2024-10-24 10:59:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:59:53,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-24 10:59:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:59:53,487 INFO L225 Difference]: With dead ends: 145 [2024-10-24 10:59:53,487 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 10:59:53,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:59:53,489 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:59:53,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:59:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 10:59:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 10:59:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 10:59:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2024-10-24 10:59:53,501 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 141 [2024-10-24 10:59:53,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:59:53,503 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2024-10-24 10:59:53,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:59:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2024-10-24 10:59:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 10:59:53,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:59:53,506 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:59:53,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:59:53,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:59:53,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:59:53,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1107727578, now seen corresponding path program 1 times [2024-10-24 10:59:53,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:59:53,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305372762] [2024-10-24 10:59:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:59:53,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:59:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:59:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:59:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:59:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:59:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:59:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:59:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:59:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:59:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 10:59:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:59:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 10:59:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 10:59:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 10:59:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 10:59:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 10:59:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 10:59:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 10:59:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 10:59:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 10:59:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 10:59:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 10:59:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 10:59:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:59:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 10:59:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:59:57,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305372762] [2024-10-24 10:59:57,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305372762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:59:57,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:59:57,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:59:57,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838273153] [2024-10-24 10:59:57,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:59:57,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:59:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:59:57,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:59:57,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:59:57,529 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:59:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:59:58,607 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2024-10-24 10:59:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:59:58,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-24 10:59:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:59:58,610 INFO L225 Difference]: With dead ends: 178 [2024-10-24 10:59:58,610 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 10:59:58,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:59:58,612 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 37 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 10:59:58,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 417 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 10:59:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 10:59:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-24 10:59:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 75 states have internal predecessors, (100), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 10:59:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-24 10:59:58,628 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 141 [2024-10-24 10:59:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:59:58,628 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-24 10:59:58,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:59:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-24 10:59:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 10:59:58,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:59:58,631 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:59:58,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:59:58,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:59:58,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:59:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash 141776580, now seen corresponding path program 1 times [2024-10-24 10:59:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:59:58,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242562167] [2024-10-24 10:59:58,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:59:58,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:59:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:00:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:00:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:00:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:00:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:00:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:00:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:00:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:00:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 11:00:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 11:00:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 11:00:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 11:00:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:00:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:00:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 11:00:02,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:02,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242562167] [2024-10-24 11:00:02,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242562167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:02,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:02,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:00:02,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759886646] [2024-10-24 11:00:02,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:02,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:00:02,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:02,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:00:02,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:00:02,625 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:03,146 INFO L93 Difference]: Finished difference Result 243 states and 351 transitions. [2024-10-24 11:00:03,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:00:03,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-24 11:00:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:03,152 INFO L225 Difference]: With dead ends: 243 [2024-10-24 11:00:03,153 INFO L226 Difference]: Without dead ends: 141 [2024-10-24 11:00:03,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:00:03,155 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 97 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:03,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 382 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:00:03,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-24 11:00:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-10-24 11:00:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 105 states have internal predecessors, (136), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:00:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 196 transitions. [2024-10-24 11:00:03,190 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 196 transitions. Word has length 142 [2024-10-24 11:00:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:03,190 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 196 transitions. [2024-10-24 11:00:03,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 196 transitions. [2024-10-24 11:00:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 11:00:03,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:03,193 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:03,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:00:03,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:03,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash -445029434, now seen corresponding path program 1 times [2024-10-24 11:00:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:03,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667450146] [2024-10-24 11:00:03,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:03,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:00:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:00:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:00:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:00:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:00:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:00:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:00:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:00:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 11:00:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 11:00:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 11:00:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 11:00:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:00:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:00:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 11:00:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667450146] [2024-10-24 11:00:03,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667450146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:03,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:03,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:00:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065061111] [2024-10-24 11:00:03,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:03,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:00:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:03,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:00:03,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:00:03,777 INFO L87 Difference]: Start difference. First operand 137 states and 196 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:04,069 INFO L93 Difference]: Finished difference Result 274 states and 389 transitions. [2024-10-24 11:00:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:00:04,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-24 11:00:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:04,071 INFO L225 Difference]: With dead ends: 274 [2024-10-24 11:00:04,071 INFO L226 Difference]: Without dead ends: 145 [2024-10-24 11:00:04,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:00:04,073 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 40 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:04,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 462 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:00:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-24 11:00:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2024-10-24 11:00:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 81 states have (on average 1.308641975308642) internal successors, (106), 83 states have internal predecessors, (106), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:00:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-10-24 11:00:04,091 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 142 [2024-10-24 11:00:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:04,091 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-10-24 11:00:04,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-10-24 11:00:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 11:00:04,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:04,093 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:04,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:00:04,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:04,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash -6372629, now seen corresponding path program 1 times [2024-10-24 11:00:04,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:04,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131855809] [2024-10-24 11:00:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:04,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:00:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:00:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:00:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:00:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:00:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:00:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:00:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:00:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 11:00:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 11:00:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 11:00:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 11:00:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:00:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:00:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 11:00:07,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:07,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131855809] [2024-10-24 11:00:07,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131855809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:07,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:07,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:00:07,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107548634] [2024-10-24 11:00:07,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:07,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:00:07,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:07,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:00:07,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:00:07,596 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:08,658 INFO L93 Difference]: Finished difference Result 351 states and 493 transitions. [2024-10-24 11:00:08,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:00:08,659 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-24 11:00:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:08,662 INFO L225 Difference]: With dead ends: 351 [2024-10-24 11:00:08,662 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 11:00:08,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:00:08,664 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 186 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:08,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 587 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:00:08,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 11:00:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 145. [2024-10-24 11:00:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:00:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-24 11:00:08,699 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-24 11:00:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:08,699 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-24 11:00:08,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-24 11:00:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 11:00:08,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:08,702 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:08,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:00:08,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:08,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:08,703 INFO L85 PathProgramCache]: Analyzing trace with hash -399399639, now seen corresponding path program 1 times [2024-10-24 11:00:08,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:08,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328810886] [2024-10-24 11:00:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:08,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:00:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:00:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:00:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:00:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:00:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:00:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:00:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:00:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 11:00:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 11:00:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 11:00:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 11:00:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:00:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:00:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 11:00:11,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:11,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328810886] [2024-10-24 11:00:11,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328810886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:11,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:11,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:00:11,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897405938] [2024-10-24 11:00:11,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:11,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:00:11,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:11,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:00:11,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:00:11,483 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:12,878 INFO L93 Difference]: Finished difference Result 360 states and 505 transitions. [2024-10-24 11:00:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:00:12,879 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-24 11:00:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:12,881 INFO L225 Difference]: With dead ends: 360 [2024-10-24 11:00:12,881 INFO L226 Difference]: Without dead ends: 223 [2024-10-24 11:00:12,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:00:12,883 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 286 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:12,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 302 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:00:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-24 11:00:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 145. [2024-10-24 11:00:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:00:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-24 11:00:12,910 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-24 11:00:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:12,910 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-24 11:00:12,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-24 11:00:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 11:00:12,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:12,912 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:12,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:00:12,912 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:12,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash 251792809, now seen corresponding path program 1 times [2024-10-24 11:00:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:12,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705421489] [2024-10-24 11:00:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:12,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:00:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:00:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:00:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:00:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:00:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:00:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:00:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:00:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 11:00:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 11:00:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 11:00:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 11:00:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:00:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:00:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 11:00:14,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:14,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705421489] [2024-10-24 11:00:14,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705421489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:14,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:14,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:00:14,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916063640] [2024-10-24 11:00:14,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:14,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:00:14,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:14,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:00:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:00:14,552 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:15,468 INFO L93 Difference]: Finished difference Result 388 states and 542 transitions. [2024-10-24 11:00:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:00:15,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-24 11:00:15,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:15,471 INFO L225 Difference]: With dead ends: 388 [2024-10-24 11:00:15,471 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 11:00:15,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:00:15,472 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 94 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:15,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 525 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:00:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 11:00:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 149. [2024-10-24 11:00:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 118 states have internal predecessors, (155), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:00:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 211 transitions. [2024-10-24 11:00:15,495 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 211 transitions. Word has length 143 [2024-10-24 11:00:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:15,495 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 211 transitions. [2024-10-24 11:00:15,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions. [2024-10-24 11:00:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 11:00:15,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:15,497 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:15,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:00:15,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:15,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash -141234201, now seen corresponding path program 1 times [2024-10-24 11:00:15,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:15,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852031844] [2024-10-24 11:00:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:00:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:00:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:00:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:00:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:00:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:00:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:00:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:00:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 11:00:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 11:00:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 11:00:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 11:00:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:00:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:00:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 11:00:17,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852031844] [2024-10-24 11:00:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852031844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:17,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:17,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:00:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340769250] [2024-10-24 11:00:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:17,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:00:17,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:17,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:00:17,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:00:17,972 INFO L87 Difference]: Start difference. First operand 149 states and 211 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:19,279 INFO L93 Difference]: Finished difference Result 358 states and 503 transitions. [2024-10-24 11:00:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:00:19,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-24 11:00:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:19,282 INFO L225 Difference]: With dead ends: 358 [2024-10-24 11:00:19,282 INFO L226 Difference]: Without dead ends: 217 [2024-10-24 11:00:19,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:00:19,283 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 94 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:19,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 575 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:00:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-24 11:00:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 145. [2024-10-24 11:00:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:00:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-24 11:00:19,307 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-24 11:00:19,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:19,307 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-24 11:00:19,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-24 11:00:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:00:19,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:19,309 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:19,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:00:19,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:19,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1282873403, now seen corresponding path program 1 times [2024-10-24 11:00:19,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:19,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408783430] [2024-10-24 11:00:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:19,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:00:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:00:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:00:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:00:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:00:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:00:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:00:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:00:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 11:00:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 11:00:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 11:00:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 11:00:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:00:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:00:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 11:00:19,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:19,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408783430] [2024-10-24 11:00:19,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408783430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:19,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:19,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:00:19,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884451696] [2024-10-24 11:00:19,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:19,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:00:19,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:19,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:00:19,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:00:19,407 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:19,524 INFO L93 Difference]: Finished difference Result 345 states and 485 transitions. [2024-10-24 11:00:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:00:19,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-24 11:00:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:19,529 INFO L225 Difference]: With dead ends: 345 [2024-10-24 11:00:19,529 INFO L226 Difference]: Without dead ends: 208 [2024-10-24 11:00:19,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:00:19,530 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:19,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 158 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:00:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-24 11:00:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2024-10-24 11:00:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 149 states have internal predecessors, (196), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:00:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 252 transitions. [2024-10-24 11:00:19,560 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 252 transitions. Word has length 144 [2024-10-24 11:00:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:19,561 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 252 transitions. [2024-10-24 11:00:19,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 252 transitions. [2024-10-24 11:00:19,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:00:19,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:19,564 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:19,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:00:19,564 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:19,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:19,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1922919577, now seen corresponding path program 1 times [2024-10-24 11:00:19,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:19,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811220680] [2024-10-24 11:00:19,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:00:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:00:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:00:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:00:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:00:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:00:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:00:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:00:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 11:00:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 11:00:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 11:00:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 11:00:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:00:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:00:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 11:00:19,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:19,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811220680] [2024-10-24 11:00:19,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811220680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:19,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:19,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:00:19,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884273207] [2024-10-24 11:00:19,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:19,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:00:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:00:19,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:00:19,782 INFO L87 Difference]: Start difference. First operand 180 states and 252 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:19,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:19,952 INFO L93 Difference]: Finished difference Result 503 states and 704 transitions. [2024-10-24 11:00:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:00:19,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-24 11:00:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:19,955 INFO L225 Difference]: With dead ends: 503 [2024-10-24 11:00:19,955 INFO L226 Difference]: Without dead ends: 324 [2024-10-24 11:00:19,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:00:19,959 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 84 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:19,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 366 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:00:19,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-24 11:00:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 227. [2024-10-24 11:00:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 171 states have internal predecessors, (219), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 11:00:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2024-10-24 11:00:20,001 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 144 [2024-10-24 11:00:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:20,001 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2024-10-24 11:00:20,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2024-10-24 11:00:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:00:20,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:20,003 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:20,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:00:20,004 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:20,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash -932675079, now seen corresponding path program 1 times [2024-10-24 11:00:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:20,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183085407] [2024-10-24 11:00:20,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:20,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:00:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:00:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:00:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:00:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:00:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:00:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:00:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:00:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 11:00:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:00:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:00:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 11:00:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 11:00:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 11:00:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 11:00:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:00:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 11:00:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 11:00:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 11:00:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 11:00:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:00:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 11:00:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 11:00:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:00:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183085407] [2024-10-24 11:00:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183085407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:20,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:00:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977832003] [2024-10-24 11:00:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:20,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:00:20,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:00:20,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:00:20,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:00:20,105 INFO L87 Difference]: Start difference. First operand 227 states and 319 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:20,225 INFO L93 Difference]: Finished difference Result 431 states and 598 transitions. [2024-10-24 11:00:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:00:20,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-24 11:00:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:20,227 INFO L225 Difference]: With dead ends: 431 [2024-10-24 11:00:20,227 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 11:00:20,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:00:20,229 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:20,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 180 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:00:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 11:00:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 214. [2024-10-24 11:00:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 158 states have (on average 1.2784810126582278) internal successors, (202), 159 states have internal predecessors, (202), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 11:00:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 298 transitions. [2024-10-24 11:00:20,262 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 298 transitions. Word has length 144 [2024-10-24 11:00:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:20,263 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 298 transitions. [2024-10-24 11:00:20,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 298 transitions. [2024-10-24 11:00:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 11:00:20,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:20,264 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:20,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:00:20,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:20,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:20,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1952165040, now seen corresponding path program 1 times [2024-10-24 11:00:20,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:00:20,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500005662] [2024-10-24 11:00:20,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:00:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:00:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102954501] [2024-10-24 11:00:20,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:20,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:00:20,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:00:20,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:00:20,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:00:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:00:20,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:00:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:00:20,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:00:20,952 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:00:20,954 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:00:20,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:00:21,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-24 11:00:21,159 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:21,273 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:00:21,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:00:21 BoogieIcfgContainer [2024-10-24 11:00:21,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:00:21,277 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:00:21,277 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:00:21,277 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:00:21,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:59:52" (3/4) ... [2024-10-24 11:00:21,280 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:00:21,281 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:00:21,282 INFO L158 Benchmark]: Toolchain (without parser) took 30370.97ms. Allocated memory was 176.2MB in the beginning and 509.6MB in the end (delta: 333.4MB). Free memory was 119.3MB in the beginning and 447.9MB in the end (delta: -328.6MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-10-24 11:00:21,282 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:00:21,282 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.27ms. Allocated memory is still 176.2MB. Free memory was 119.3MB in the beginning and 103.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:00:21,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.54ms. Allocated memory is still 176.2MB. Free memory was 103.3MB in the beginning and 99.6MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:00:21,283 INFO L158 Benchmark]: Boogie Preprocessor took 76.71ms. Allocated memory is still 176.2MB. Free memory was 99.6MB in the beginning and 94.6MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:00:21,284 INFO L158 Benchmark]: RCFGBuilder took 649.53ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 94.6MB in the beginning and 194.5MB in the end (delta: -99.9MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-10-24 11:00:21,284 INFO L158 Benchmark]: TraceAbstraction took 29189.45ms. Allocated memory was 243.3MB in the beginning and 509.6MB in the end (delta: 266.3MB). Free memory was 194.5MB in the beginning and 448.9MB in the end (delta: -254.5MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-10-24 11:00:21,284 INFO L158 Benchmark]: Witness Printer took 4.29ms. Allocated memory is still 509.6MB. Free memory was 448.9MB in the beginning and 447.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:00:21,286 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.17ms. Allocated memory is still 176.2MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.27ms. Allocated memory is still 176.2MB. Free memory was 119.3MB in the beginning and 103.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.54ms. Allocated memory is still 176.2MB. Free memory was 103.3MB in the beginning and 99.6MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.71ms. Allocated memory is still 176.2MB. Free memory was 99.6MB in the beginning and 94.6MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 649.53ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 94.6MB in the beginning and 194.5MB in the end (delta: -99.9MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29189.45ms. Allocated memory was 243.3MB in the beginning and 509.6MB in the end (delta: 266.3MB). Free memory was 194.5MB in the beginning and 448.9MB in the end (delta: -254.5MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Witness Printer took 4.29ms. Allocated memory is still 509.6MB. Free memory was 448.9MB in the beginning and 447.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: 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 someBinaryDOUBLEComparisonOperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] unsigned short int last_1_var_1_15 = 128; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] last_1_var_1_15 = var_1_15 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L92] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L96] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L98] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L106] var_1_16 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L109] var_1_17 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L110] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L111] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L127] RET updateVariables() [L128] CALL step() [L45] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L45] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L50] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L52] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L52] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L53] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L54] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L58] signed long int stepLocal_1 = -4; [L59] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L60] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L65] var_1_18 = var_1_17 [L66] var_1_19 = 0 [L67] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L68] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L71] COND TRUE var_1_3 <= var_1_1 [L72] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L76] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32767, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L77] COND TRUE (~ var_1_3) < stepLocal_2 [L78] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L119-L120] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.0s, OverallIterations: 13, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1106 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1106 mSDsluCounter, 4169 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2984 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2608 IncrementalHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 1185 mSDtfsCounter, 2608 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=11, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 553 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 2001 NumberOfCodeBlocks, 2001 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1699 ConstructedInterpolants, 0 QuantifiedInterpolants, 8648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 11088/11088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:00:21,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 8c68e7f909dde8700553fab87bbeaa91d2497338979474d785c0ae04bfaf91cb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:00:23,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:00:23,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:00:23,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:00:23,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:00:23,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:00:23,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:00:23,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:00:23,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:00:23,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:00:23,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:00:23,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:00:23,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:00:23,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:00:23,797 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:00:23,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:00:23,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:00:23,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:00:23,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:00:23,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:00:23,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:00:23,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:00:23,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:00:23,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:00:23,803 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:00:23,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:00:23,803 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:00:23,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:00:23,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:00:23,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:00:23,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:00:23,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:00:23,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:00:23,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:00:23,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:00:23,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:00:23,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:00:23,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:00:23,807 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:00:23,807 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:00:23,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:00:23,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:00:23,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:00:23,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:00:23,809 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:00:23,809 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c68e7f909dde8700553fab87bbeaa91d2497338979474d785c0ae04bfaf91cb [2024-10-24 11:00:24,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:00:24,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:00:24,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:00:24,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:00:24,186 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:00:24,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i [2024-10-24 11:00:25,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:00:25,915 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:00:25,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i [2024-10-24 11:00:25,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cbc3d5d0/b61a7eb7528a4d09823e6d7c5da4fadf/FLAG3ffc41468 [2024-10-24 11:00:26,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cbc3d5d0/b61a7eb7528a4d09823e6d7c5da4fadf [2024-10-24 11:00:26,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:00:26,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:00:26,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:00:26,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:00:26,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:00:26,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed3b1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26, skipping insertion in model container [2024-10-24 11:00:26,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:00:26,505 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i[915,928] [2024-10-24 11:00:26,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:00:26,625 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:00:26,637 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-84.i[915,928] [2024-10-24 11:00:26,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:00:26,700 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:00:26,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26 WrapperNode [2024-10-24 11:00:26,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:00:26,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:00:26,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:00:26,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:00:26,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,761 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-10-24 11:00:26,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:00:26,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:00:26,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:00:26,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:00:26,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,807 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:00:26,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:00:26,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:00:26,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:00:26,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:00:26,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (1/1) ... [2024-10-24 11:00:26,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:00:26,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:00:26,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:00:26,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:00:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:00:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:00:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:00:26,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:00:26,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:00:26,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:00:27,042 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:00:27,044 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:00:27,482 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 11:00:27,482 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:00:27,546 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:00:27,546 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:00:27,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:00:27 BoogieIcfgContainer [2024-10-24 11:00:27,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:00:27,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:00:27,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:00:27,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:00:27,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:00:26" (1/3) ... [2024-10-24 11:00:27,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e287686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:00:27, skipping insertion in model container [2024-10-24 11:00:27,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:00:26" (2/3) ... [2024-10-24 11:00:27,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e287686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:00:27, skipping insertion in model container [2024-10-24 11:00:27,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:00:27" (3/3) ... [2024-10-24 11:00:27,559 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-84.i [2024-10-24 11:00:27,577 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:00:27,578 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:00:27,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:00:27,659 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;@1b8c6096, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:00:27,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:00:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:00:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:00:27,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:27,678 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:27,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:27,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash -153112892, now seen corresponding path program 1 times [2024-10-24 11:00:27,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:00:27,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144949144] [2024-10-24 11:00:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:27,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:00:27,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:00:27,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:00:27,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:00:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:27,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:00:27,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:00:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2024-10-24 11:00:28,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:00:28,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:00:28,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144949144] [2024-10-24 11:00:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144949144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:28,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:28,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:00:28,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226197098] [2024-10-24 11:00:28,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:28,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:00:28,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:00:28,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:00:28,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:00:28,085 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 11:00:28,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:28,191 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2024-10-24 11:00:28,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:00:28,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2024-10-24 11:00:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:28,214 INFO L225 Difference]: With dead ends: 111 [2024-10-24 11:00:28,215 INFO L226 Difference]: Without dead ends: 55 [2024-10-24 11:00:28,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:00:28,223 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:28,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:00:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-24 11:00:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-24 11:00:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:00:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 84 transitions. [2024-10-24 11:00:28,277 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 84 transitions. Word has length 135 [2024-10-24 11:00:28,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:28,278 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 84 transitions. [2024-10-24 11:00:28,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 11:00:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 84 transitions. [2024-10-24 11:00:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:00:28,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:28,285 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:28,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:00:28,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:00:28,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:28,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1571604612, now seen corresponding path program 1 times [2024-10-24 11:00:28,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:00:28,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437844714] [2024-10-24 11:00:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:28,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:00:28,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:00:28,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:00:28,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:00:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:28,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:00:28,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:00:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 11:00:28,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:00:28,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:00:28,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437844714] [2024-10-24 11:00:28,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437844714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:00:28,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:00:28,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:00:28,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538293741] [2024-10-24 11:00:28,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:00:28,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:00:28,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:00:28,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:00:28,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:00:28,718 INFO L87 Difference]: Start difference. First operand 55 states and 84 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:00:28,803 INFO L93 Difference]: Finished difference Result 109 states and 167 transitions. [2024-10-24 11:00:28,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:00:28,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2024-10-24 11:00:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:00:28,816 INFO L225 Difference]: With dead ends: 109 [2024-10-24 11:00:28,816 INFO L226 Difference]: Without dead ends: 55 [2024-10-24 11:00:28,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:00:28,818 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:00:28,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 79 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:00:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-24 11:00:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-24 11:00:28,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:00:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2024-10-24 11:00:28,833 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 135 [2024-10-24 11:00:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:00:28,836 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2024-10-24 11:00:28,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 11:00:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2024-10-24 11:00:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:00:28,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:00:28,840 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:00:28,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:00:29,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:00:29,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:00:29,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:00:29,042 INFO L85 PathProgramCache]: Analyzing trace with hash -948355322, now seen corresponding path program 1 times [2024-10-24 11:00:29,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:00:29,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762825727] [2024-10-24 11:00:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:00:29,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:00:29,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:00:29,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:00:29,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:00:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:00:29,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 11:00:29,257 INFO L278 TraceCheckSpWp]: Computing forward predicates...