./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-10.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-10.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 d7b31703d13ddb01e2d77e44fcd8433b76663feaf751198b77497c752932cfd2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:50:39,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:50:39,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:50:39,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:50:39,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:50:39,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:50:39,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:50:39,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:50:39,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:50:39,386 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:50:39,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:50:39,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:50:39,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:50:39,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:50:39,387 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:50:39,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:50:39,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:50:39,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:50:39,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:50:39,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:50:39,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:50:39,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:50:39,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:50:39,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:50:39,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:50:39,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:50:39,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:50:39,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:50:39,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:50:39,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:50:39,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:50:39,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:50:39,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:50:39,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:50:39,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:50:39,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:50:39,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:50:39,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:50:39,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:50:39,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:50:39,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:50:39,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:50:39,395 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 -> d7b31703d13ddb01e2d77e44fcd8433b76663feaf751198b77497c752932cfd2 [2024-10-24 10:50:39,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:50:39,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:50:39,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:50:39,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:50:39,584 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:50:39,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-10.i [2024-10-24 10:50:40,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:50:41,201 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:50:41,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-10.i [2024-10-24 10:50:41,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf2bf1608/8f2be22e91b24d119008cc931b728b6e/FLAG6288d2a8e [2024-10-24 10:50:41,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf2bf1608/8f2be22e91b24d119008cc931b728b6e [2024-10-24 10:50:41,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:50:41,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:50:41,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:50:41,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:50:41,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:50:41,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da5130a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41, skipping insertion in model container [2024-10-24 10:50:41,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:41,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:50:41,779 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-10.i[915,928] [2024-10-24 10:50:41,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:50:41,841 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:50:41,850 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-10.i[915,928] [2024-10-24 10:50:41,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:50:41,935 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:50:41,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41 WrapperNode [2024-10-24 10:50:41,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:50:41,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:50:41,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:50:41,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:50:41,948 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:50:41" (1/1) ... [2024-10-24 10:50:41,996 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:50:41" (1/1) ... [2024-10-24 10:50:42,044 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-10-24 10:50:42,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:50:42,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:50:42,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:50:42,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:50:42,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:42,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:42,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:42,091 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:50:42,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:42,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:42,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:42,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:42,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:42,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:42,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:50:42,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:50:42,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:50:42,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:50:42,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (1/1) ... [2024-10-24 10:50:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:50:42,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:50:42,152 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:50:42,157 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:50:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:50:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:50:42,191 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:50:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:50:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:50:42,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:50:42,258 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:50:42,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:50:42,580 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-24 10:50:42,580 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:50:42,601 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:50:42,602 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:50:42,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:50:42 BoogieIcfgContainer [2024-10-24 10:50:42,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:50:42,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:50:42,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:50:42,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:50:42,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:50:41" (1/3) ... [2024-10-24 10:50:42,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d997b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:50:42, skipping insertion in model container [2024-10-24 10:50:42,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:50:41" (2/3) ... [2024-10-24 10:50:42,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d997b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:50:42, skipping insertion in model container [2024-10-24 10:50:42,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:50:42" (3/3) ... [2024-10-24 10:50:42,610 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-10.i [2024-10-24 10:50:42,626 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:50:42,626 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:50:42,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:50:42,706 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;@18e754fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:50:42,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:50:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 10:50:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 10:50:42,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:42,722 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:42,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:42,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1063547397, now seen corresponding path program 1 times [2024-10-24 10:50:42,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:50:42,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176427328] [2024-10-24 10:50:42,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:42,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:50:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:50:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:50:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:50:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:50:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:50:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:50:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:50:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:50:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:50:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:50:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:50:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:50:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:50:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:50:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:50:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:50:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:50:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 10:50:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:50:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 10:50:43,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:50:43,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176427328] [2024-10-24 10:50:43,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176427328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:50:43,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:50:43,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:50:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732713722] [2024-10-24 10:50:43,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:50:43,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:50:43,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:50:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:50:43,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:50:43,681 INFO L87 Difference]: Start difference. First operand has 68 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 10:50:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:50:43,915 INFO L93 Difference]: Finished difference Result 199 states and 347 transitions. [2024-10-24 10:50:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:50:43,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-10-24 10:50:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:50:43,929 INFO L225 Difference]: With dead ends: 199 [2024-10-24 10:50:43,930 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 10:50:43,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:50:43,940 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:50:43,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 367 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:50:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 10:50:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2024-10-24 10:50:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 10:50:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 149 transitions. [2024-10-24 10:50:44,001 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 149 transitions. Word has length 118 [2024-10-24 10:50:44,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:50:44,002 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 149 transitions. [2024-10-24 10:50:44,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 10:50:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 149 transitions. [2024-10-24 10:50:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 10:50:44,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:50:44,007 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:44,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:50:44,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:50:44,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:50:44,008 INFO L85 PathProgramCache]: Analyzing trace with hash -315130074, now seen corresponding path program 1 times [2024-10-24 10:50:44,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:50:44,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383287619] [2024-10-24 10:50:44,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:50:44,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:50:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:51:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:51:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:51:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:51:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:51:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:51:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:51:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:51:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:51:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:51:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:51:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:51:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:51:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:51:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:51:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:51:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:51:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 10:51:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 10:51:01,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:51:01,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383287619] [2024-10-24 10:51:01,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383287619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:51:01,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:51:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 10:51:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887388376] [2024-10-24 10:51:01,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:51:01,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 10:51:01,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:51:01,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 10:51:01,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 10:51:01,680 INFO L87 Difference]: Start difference. First operand 99 states and 149 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 10:51:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:51:03,139 INFO L93 Difference]: Finished difference Result 336 states and 486 transitions. [2024-10-24 10:51:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 10:51:03,140 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2024-10-24 10:51:03,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:51:03,142 INFO L225 Difference]: With dead ends: 336 [2024-10-24 10:51:03,142 INFO L226 Difference]: Without dead ends: 271 [2024-10-24 10:51:03,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-10-24 10:51:03,144 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 506 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 10:51:03,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 576 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 10:51:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-24 10:51:03,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 188. [2024-10-24 10:51:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 128 states have internal predecessors, (165), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 10:51:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 273 transitions. [2024-10-24 10:51:03,178 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 273 transitions. Word has length 119 [2024-10-24 10:51:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:51:03,179 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 273 transitions. [2024-10-24 10:51:03,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 10:51:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 273 transitions. [2024-10-24 10:51:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 10:51:03,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:51:03,181 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:03,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:51:03,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:51:03,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:51:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1124476700, now seen corresponding path program 1 times [2024-10-24 10:51:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:51:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867350064] [2024-10-24 10:51:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:51:03,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:51:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:51:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:51:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:51:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:51:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:51:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:51:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:51:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:51:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:51:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:51:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:51:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:51:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:51:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:51:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:51:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:51:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:51:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 10:51:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:51:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 10:51:54,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:51:54,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867350064] [2024-10-24 10:51:54,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867350064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:51:54,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:51:54,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 10:51:54,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180326168] [2024-10-24 10:51:54,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:51:54,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 10:51:54,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:51:54,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 10:51:54,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-24 10:51:54,629 INFO L87 Difference]: Start difference. First operand 188 states and 273 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 10:51:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:51:56,548 INFO L93 Difference]: Finished difference Result 335 states and 480 transitions. [2024-10-24 10:51:56,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 10:51:56,548 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2024-10-24 10:51:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:51:56,551 INFO L225 Difference]: With dead ends: 335 [2024-10-24 10:51:56,551 INFO L226 Difference]: Without dead ends: 270 [2024-10-24 10:51:56,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2024-10-24 10:51:56,553 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 512 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 10:51:56,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 507 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 10:51:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-24 10:51:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 188. [2024-10-24 10:51:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 128 states have internal predecessors, (165), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 10:51:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 273 transitions. [2024-10-24 10:51:56,574 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 273 transitions. Word has length 119 [2024-10-24 10:51:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:51:56,574 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 273 transitions. [2024-10-24 10:51:56,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 10:51:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 273 transitions. [2024-10-24 10:51:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 10:51:56,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:51:56,577 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:56,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:51:56,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:51:56,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:51:56,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1890626918, now seen corresponding path program 1 times [2024-10-24 10:51:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:51:56,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924722828] [2024-10-24 10:51:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:51:56,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:51:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:52:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:52:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:52:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:52:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:52:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:52:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:52:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:52:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:52:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:52:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:52:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:52:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:52:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:52:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:52:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:52:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:52:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 10:52:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:52:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 10:52:11,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:52:11,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924722828] [2024-10-24 10:52:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924722828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:52:11,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:52:11,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 10:52:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143177259] [2024-10-24 10:52:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:52:11,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 10:52:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:52:11,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 10:52:11,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 10:52:11,809 INFO L87 Difference]: Start difference. First operand 188 states and 273 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 10:52:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:52:12,829 INFO L93 Difference]: Finished difference Result 405 states and 581 transitions. [2024-10-24 10:52:12,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 10:52:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-10-24 10:52:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:52:12,833 INFO L225 Difference]: With dead ends: 405 [2024-10-24 10:52:12,834 INFO L226 Difference]: Without dead ends: 253 [2024-10-24 10:52:12,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-10-24 10:52:12,839 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 284 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:52:12,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 471 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 10:52:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-24 10:52:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 190. [2024-10-24 10:52:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 129 states have (on average 1.2945736434108528) internal successors, (167), 130 states have internal predecessors, (167), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 10:52:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 275 transitions. [2024-10-24 10:52:12,867 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 275 transitions. Word has length 119 [2024-10-24 10:52:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:52:12,868 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 275 transitions. [2024-10-24 10:52:12,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 10:52:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 275 transitions. [2024-10-24 10:52:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 10:52:12,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:52:12,869 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:12,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:52:12,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:52:12,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:52:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1903477976, now seen corresponding path program 1 times [2024-10-24 10:52:12,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:52:12,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951052575] [2024-10-24 10:52:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:52:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:52:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat