./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.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 b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:15:51,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:15:51,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:15:51,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:15:51,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:15:51,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:15:51,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:15:51,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:15:51,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:15:51,130 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:15:51,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:15:51,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:15:51,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:15:51,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:15:51,134 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:15:51,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:15:51,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:15:51,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:15:51,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:15:51,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:15:51,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:15:51,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:15:51,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:15:51,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:15:51,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:15:51,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:15:51,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:15:51,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:15:51,143 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:15:51,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:15:51,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:15:51,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:15:51,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:15:51,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:15:51,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:15:51,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:15:51,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:15:51,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:15:51,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:15:51,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:15:51,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:15:51,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:15:51,148 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 -> b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f [2024-11-10 03:15:51,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:15:51,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:15:51,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:15:51,432 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:15:51,433 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:15:51,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i [2024-11-10 03:15:52,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:15:53,177 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:15:53,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i [2024-11-10 03:15:53,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bd0437b7/668a72e131184ef9bee0bea51c436abe/FLAGf88da3c77 [2024-11-10 03:15:53,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bd0437b7/668a72e131184ef9bee0bea51c436abe [2024-11-10 03:15:53,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:15:53,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:15:53,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:15:53,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:15:53,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:15:53,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4c00aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53, skipping insertion in model container [2024-11-10 03:15:53,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:15:53,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i[919,932] [2024-11-10 03:15:53,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:15:53,537 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:15:53,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i[919,932] [2024-11-10 03:15:53,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:15:53,627 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:15:53,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53 WrapperNode [2024-11-10 03:15:53,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:15:53,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:15:53,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:15:53,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:15:53,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,685 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2024-11-10 03:15:53,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:15:53,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:15:53,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:15:53,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:15:53,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,743 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:15:53,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:15:53,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:15:53,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:15:53,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:15:53,778 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (1/1) ... [2024-11-10 03:15:53,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:15:53,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:15:53,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:15:53,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:15:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:15:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:15:53,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:15:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:15:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:15:53,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:15:53,940 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:15:53,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:15:54,318 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc property_#t~ite17#1;havoc property_#t~ite16#1;havoc property_#t~bitwise15#1;havoc property_#t~short18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2024-11-10 03:15:54,353 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 03:15:54,354 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:15:54,393 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:15:54,396 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:15:54,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:54 BoogieIcfgContainer [2024-11-10 03:15:54,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:15:54,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:15:54,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:15:54,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:15:54,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:15:53" (1/3) ... [2024-11-10 03:15:54,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547951b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:15:54, skipping insertion in model container [2024-11-10 03:15:54,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:53" (2/3) ... [2024-11-10 03:15:54,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547951b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:15:54, skipping insertion in model container [2024-11-10 03:15:54,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:54" (3/3) ... [2024-11-10 03:15:54,410 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-97.i [2024-11-10 03:15:54,429 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:15:54,431 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:15:54,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:15:54,510 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;@643af992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:15:54,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:15:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:15:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 03:15:54,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:54,531 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:15:54,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:54,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 449396430, now seen corresponding path program 1 times [2024-11-10 03:15:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:54,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840934945] [2024-11-10 03:15:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:15:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:15:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:15:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:15:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:15:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 03:15:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:15:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:15:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:15:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:15:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:54,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:15:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:15:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:15:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:15:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:15:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:15:55,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:55,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840934945] [2024-11-10 03:15:55,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840934945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:55,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:15:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894595426] [2024-11-10 03:15:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:55,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:15:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:55,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:15:55,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:15:55,093 INFO L87 Difference]: Start difference. First operand has 83 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 03:15:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:15:55,134 INFO L93 Difference]: Finished difference Result 158 states and 257 transitions. [2024-11-10 03:15:55,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:15:55,139 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 111 [2024-11-10 03:15:55,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:15:55,150 INFO L225 Difference]: With dead ends: 158 [2024-11-10 03:15:55,150 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 03:15:55,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-11-10 03:15:55,160 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:15:55,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:15:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 03:15:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 03:15:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:15:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-11-10 03:15:55,214 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 111 [2024-11-10 03:15:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:15:55,214 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-11-10 03:15:55,215 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 03:15:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-11-10 03:15:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 03:15:55,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:55,219 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:15:55,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:15:55,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:55,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1492641424, now seen corresponding path program 1 times [2024-11-10 03:15:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:55,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355568492] [2024-11-10 03:15:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:15:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:15:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:15:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:15:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:15:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 03:15:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:15:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:15:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:15:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:15:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:15:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:15:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:15:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:15:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:15:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:15:55,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:55,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355568492] [2024-11-10 03:15:55,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355568492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:55,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:55,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:15:55,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270205932] [2024-11-10 03:15:55,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:55,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:15:55,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:55,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:15:55,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:15:55,501 INFO L87 Difference]: Start difference. First operand 78 states and 116 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:15:55,609 INFO L93 Difference]: Finished difference Result 210 states and 312 transitions. [2024-11-10 03:15:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:15:55,610 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-10 03:15:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:15:55,613 INFO L225 Difference]: With dead ends: 210 [2024-11-10 03:15:55,613 INFO L226 Difference]: Without dead ends: 135 [2024-11-10 03:15:55,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-11-10 03:15:55,615 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 100 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:15:55,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 253 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:15:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-10 03:15:55,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 93. [2024-11-10 03:15:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:15:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2024-11-10 03:15:55,638 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 111 [2024-11-10 03:15:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:15:55,639 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2024-11-10 03:15:55,640 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2024-11-10 03:15:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 03:15:55,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:55,642 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:15:55,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:15:55,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:55,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1998200049, now seen corresponding path program 1 times [2024-11-10 03:15:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:55,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237227393] [2024-11-10 03:15:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:55,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:15:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:15:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:15:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:15:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:15:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 03:15:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:15:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:15:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:15:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:15:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:15:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:15:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:15:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:15:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:15:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:15:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237227393] [2024-11-10 03:15:56,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237227393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:56,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:56,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:15:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746597087] [2024-11-10 03:15:56,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:56,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:15:56,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:56,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:15:56,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:15:56,212 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:15:56,535 INFO L93 Difference]: Finished difference Result 301 states and 444 transitions. [2024-11-10 03:15:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:15:56,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-10 03:15:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:15:56,541 INFO L225 Difference]: With dead ends: 301 [2024-11-10 03:15:56,542 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 03:15:56,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:15:56,544 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 139 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:15:56,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 291 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:15:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 03:15:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 174. [2024-11-10 03:15:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 139 states have internal predecessors, (190), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 03:15:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 254 transitions. [2024-11-10 03:15:56,589 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 254 transitions. Word has length 111 [2024-11-10 03:15:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:15:56,590 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 254 transitions. [2024-11-10 03:15:56,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 254 transitions. [2024-11-10 03:15:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 03:15:56,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:56,596 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:15:56,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:15:56,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:56,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1470823988, now seen corresponding path program 1 times [2024-11-10 03:15:56,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:56,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250202043] [2024-11-10 03:15:56,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:56,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:15:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:15:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:56,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:15:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:15:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:15:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 03:15:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:15:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:15:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:15:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:15:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:15:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:15:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:15:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:15:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:15:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:15:57,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:57,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250202043] [2024-11-10 03:15:57,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250202043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:57,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:57,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 03:15:57,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806422490] [2024-11-10 03:15:57,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:57,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 03:15:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:57,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 03:15:57,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:15:57,077 INFO L87 Difference]: Start difference. First operand 174 states and 254 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:15:57,364 INFO L93 Difference]: Finished difference Result 431 states and 627 transitions. [2024-11-10 03:15:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:15:57,365 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-10 03:15:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:15:57,369 INFO L225 Difference]: With dead ends: 431 [2024-11-10 03:15:57,370 INFO L226 Difference]: Without dead ends: 260 [2024-11-10 03:15:57,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-11-10 03:15:57,372 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 96 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:15:57,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 450 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:15:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-10 03:15:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 232. [2024-11-10 03:15:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 180 states have (on average 1.3444444444444446) internal successors, (242), 180 states have internal predecessors, (242), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 03:15:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 338 transitions. [2024-11-10 03:15:57,407 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 338 transitions. Word has length 112 [2024-11-10 03:15:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:15:57,409 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 338 transitions. [2024-11-10 03:15:57,409 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 338 transitions. [2024-11-10 03:15:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 03:15:57,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:57,415 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:15:57,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:15:57,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:57,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:57,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2088956015, now seen corresponding path program 1 times [2024-11-10 03:15:57,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:57,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654028682] [2024-11-10 03:15:57,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:57,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:15:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:15:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:15:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:15:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:15:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 03:15:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:15:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:15:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:15:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:15:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:15:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:15:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:15:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:15:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:15:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:15:57,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:57,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654028682] [2024-11-10 03:15:57,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654028682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:57,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:57,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:15:57,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310810392] [2024-11-10 03:15:57,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:57,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:15:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:15:57,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:15:57,662 INFO L87 Difference]: Start difference. First operand 232 states and 338 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:15:57,937 INFO L93 Difference]: Finished difference Result 397 states and 578 transitions. [2024-11-10 03:15:57,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:15:57,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-10 03:15:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:15:57,941 INFO L225 Difference]: With dead ends: 397 [2024-11-10 03:15:57,941 INFO L226 Difference]: Without dead ends: 307 [2024-11-10 03:15:57,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:15:57,942 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 196 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:15:57,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 364 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:15:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-10 03:15:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 237. [2024-11-10 03:15:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 185 states have (on average 1.3513513513513513) internal successors, (250), 185 states have internal predecessors, (250), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 03:15:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 346 transitions. [2024-11-10 03:15:57,977 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 346 transitions. Word has length 113 [2024-11-10 03:15:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:15:57,980 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 346 transitions. [2024-11-10 03:15:57,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 346 transitions. [2024-11-10 03:15:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 03:15:57,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:57,982 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:15:57,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:15:57,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:57,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:57,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1191114532, now seen corresponding path program 1 times [2024-11-10 03:15:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:57,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049531436] [2024-11-10 03:15:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:57,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:15:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:15:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:15:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:15:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:15:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 03:15:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:15:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:15:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:15:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:15:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:15:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:15:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:15:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:15:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:15:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:15:58,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:58,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049531436] [2024-11-10 03:15:58,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049531436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:58,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:58,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:15:58,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002596792] [2024-11-10 03:15:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:58,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:15:58,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:58,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:15:58,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:15:58,572 INFO L87 Difference]: Start difference. First operand 237 states and 346 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:15:58,818 INFO L93 Difference]: Finished difference Result 413 states and 605 transitions. [2024-11-10 03:15:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:15:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-10 03:15:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:15:58,822 INFO L225 Difference]: With dead ends: 413 [2024-11-10 03:15:58,822 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 03:15:58,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:15:58,824 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 91 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:15:58,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 778 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:15:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 03:15:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-11-10 03:15:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 185 states have (on average 1.318918918918919) internal successors, (244), 185 states have internal predecessors, (244), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 03:15:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 340 transitions. [2024-11-10 03:15:58,872 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 340 transitions. Word has length 113 [2024-11-10 03:15:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:15:58,872 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 340 transitions. [2024-11-10 03:15:58,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 340 transitions. [2024-11-10 03:15:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 03:15:58,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:58,874 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:15:58,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:15:58,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:58,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:58,875 INFO L85 PathProgramCache]: Analyzing trace with hash 639381201, now seen corresponding path program 1 times [2024-11-10 03:15:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:58,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297022191] [2024-11-10 03:15:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:15:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:15:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:15:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:15:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:15:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:15:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 03:15:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:15:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:15:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:15:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:15:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:15:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:15:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:15:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:15:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:15:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:15:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:15:59,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:15:59,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297022191] [2024-11-10 03:15:59,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297022191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:15:59,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:15:59,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:15:59,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549110043] [2024-11-10 03:15:59,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:15:59,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:15:59,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:15:59,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:15:59,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:15:59,176 INFO L87 Difference]: Start difference. First operand 237 states and 340 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:15:59,746 INFO L93 Difference]: Finished difference Result 738 states and 1043 transitions. [2024-11-10 03:15:59,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:15:59,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-10 03:15:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:15:59,751 INFO L225 Difference]: With dead ends: 738 [2024-11-10 03:15:59,752 INFO L226 Difference]: Without dead ends: 558 [2024-11-10 03:15:59,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:15:59,754 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 282 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:15:59,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 451 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:15:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-10 03:15:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 425. [2024-11-10 03:15:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 339 states have (on average 1.303834808259587) internal successors, (442), 339 states have internal predecessors, (442), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-10 03:15:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 602 transitions. [2024-11-10 03:15:59,848 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 602 transitions. Word has length 117 [2024-11-10 03:15:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:15:59,848 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 602 transitions. [2024-11-10 03:15:59,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:15:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 602 transitions. [2024-11-10 03:15:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 03:15:59,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:15:59,850 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:15:59,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:15:59,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:15:59,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:15:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash 797808905, now seen corresponding path program 1 times [2024-11-10 03:15:59,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:15:59,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596736858] [2024-11-10 03:15:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:15:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:15:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:16:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:16:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 03:16:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:16:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:16:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:16:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 03:16:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:16:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:16:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:16:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:16:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:16:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:16:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:16:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:16:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:16:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:16:06,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:16:06,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596736858] [2024-11-10 03:16:06,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596736858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:16:06,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:16:06,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 03:16:06,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853882016] [2024-11-10 03:16:06,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:16:06,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:16:06,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:16:06,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:16:06,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:16:06,372 INFO L87 Difference]: Start difference. First operand 425 states and 602 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:16:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:08,470 INFO L93 Difference]: Finished difference Result 1084 states and 1496 transitions. [2024-11-10 03:16:08,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 03:16:08,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-10 03:16:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:08,475 INFO L225 Difference]: With dead ends: 1084 [2024-11-10 03:16:08,475 INFO L226 Difference]: Without dead ends: 707 [2024-11-10 03:16:08,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-10 03:16:08,478 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 133 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:08,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 740 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 03:16:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-10 03:16:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 632. [2024-11-10 03:16:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 534 states have (on average 1.2734082397003745) internal successors, (680), 538 states have internal predecessors, (680), 88 states have call successors, (88), 9 states have call predecessors, (88), 9 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-10 03:16:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 856 transitions. [2024-11-10 03:16:08,580 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 856 transitions. Word has length 117 [2024-11-10 03:16:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:08,580 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 856 transitions. [2024-11-10 03:16:08,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:16:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 856 transitions. [2024-11-10 03:16:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 03:16:08,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:08,582 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:08,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:16:08,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:08,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1240247384, now seen corresponding path program 1 times [2024-11-10 03:16:08,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:16:08,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434870553] [2024-11-10 03:16:08,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:08,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:16:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:16:08,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:16:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:16:08,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:16:08,730 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:16:08,731 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:16:08,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 03:16:08,736 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:08,832 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:16:08,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:16:08 BoogieIcfgContainer [2024-11-10 03:16:08,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:16:08,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:16:08,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:16:08,835 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:16:08,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:54" (3/4) ... [2024-11-10 03:16:08,840 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:16:08,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:16:08,842 INFO L158 Benchmark]: Toolchain (without parser) took 15633.55ms. Allocated memory was 142.6MB in the beginning and 381.7MB in the end (delta: 239.1MB). Free memory was 84.7MB in the beginning and 290.2MB in the end (delta: -205.5MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2024-11-10 03:16:08,842 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 90.2MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:16:08,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.13ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 108.9MB in the end (delta: -24.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 03:16:08,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.50ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 104.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:16:08,843 INFO L158 Benchmark]: Boogie Preprocessor took 88.81ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 98.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 03:16:08,844 INFO L158 Benchmark]: IcfgBuilder took 620.89ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 72.1MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 03:16:08,844 INFO L158 Benchmark]: TraceAbstraction took 14435.38ms. Allocated memory was 142.6MB in the beginning and 381.7MB in the end (delta: 239.1MB). Free memory was 71.6MB in the beginning and 290.2MB in the end (delta: -218.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 03:16:08,844 INFO L158 Benchmark]: Witness Printer took 6.44ms. Allocated memory is still 381.7MB. Free memory is still 290.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:16:08,845 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.36ms. Allocated memory is still 90.2MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.13ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 108.9MB in the end (delta: -24.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.50ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 104.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.81ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 98.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 620.89ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 72.1MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14435.38ms. Allocated memory was 142.6MB in the beginning and 381.7MB in the end (delta: 239.1MB). Free memory was 71.6MB in the beginning and 290.2MB in the end (delta: -218.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 6.44ms. Allocated memory is still 381.7MB. Free memory is still 290.2MB. 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 someBinaryFLOATComparisonOperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0, var_1_9=643/5] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L114] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0, var_1_9=643/5] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L87] var_1_9 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L88] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L89] var_1_10 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L90] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L91] var_1_11 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L92] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L94] var_1_12 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L95] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L100] var_1_14 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L103] var_1_18 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L106] var_1_19 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L109] var_1_23 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L111] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L111] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L125] RET updateVariables() [L126] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] COND TRUE (var_1_20 + var_1_15) < -200 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L62] COND FALSE !(\read(var_1_22)) [L69] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L74] COND FALSE !(256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L77] COND FALSE !(var_1_22 || var_1_22) [L82] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117-L118] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 9, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1037 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1037 mSDsluCounter, 3439 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2249 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1199 IncrementalHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 1190 mSDtfsCounter, 1199 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=632occurred in iteration=8, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 385 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1022 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 897 ConstructedInterpolants, 0 QuantifiedInterpolants, 8742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 3840/3840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:16:08,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.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 b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:16:11,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:16:11,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:16:11,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:16:11,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:16:11,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:16:11,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:16:11,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:16:11,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:16:11,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:16:11,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:16:11,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:16:11,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:16:11,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:16:11,302 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:16:11,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:16:11,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:16:11,303 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:16:11,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:16:11,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:16:11,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:16:11,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:16:11,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:16:11,309 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:16:11,309 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:16:11,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:16:11,310 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:16:11,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:16:11,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:16:11,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:16:11,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:16:11,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:16:11,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:16:11,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:16:11,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:16:11,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:16:11,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:16:11,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:16:11,314 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:16:11,314 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:16:11,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:16:11,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:16:11,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:16:11,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:16:11,315 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 -> b7a9f76a8f140f3e23a190528056f362449b512050c0034b2a11947040898a2f [2024-11-10 03:16:11,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:16:11,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:16:11,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:16:11,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:16:11,728 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:16:11,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i [2024-11-10 03:16:13,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:16:13,584 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:16:13,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i [2024-11-10 03:16:13,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d491a888/d1d534d062b048e5a1b84c1a11ee30d1/FLAGc3aac61ce [2024-11-10 03:16:13,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d491a888/d1d534d062b048e5a1b84c1a11ee30d1 [2024-11-10 03:16:13,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:16:13,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:16:13,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:16:13,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:16:13,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:16:13,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:16:13" (1/1) ... [2024-11-10 03:16:13,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33935ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:13, skipping insertion in model container [2024-11-10 03:16:13,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:16:13" (1/1) ... [2024-11-10 03:16:13,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:16:14,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i[919,932] [2024-11-10 03:16:14,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:16:14,249 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:16:14,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-97.i[919,932] [2024-11-10 03:16:14,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:16:14,328 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:16:14,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14 WrapperNode [2024-11-10 03:16:14,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:16:14,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:16:14,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:16:14,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:16:14,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,379 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-10 03:16:14,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:16:14,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:16:14,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:16:14,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:16:14,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,408 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:16:14,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:16:14,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:16:14,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:16:14,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:16:14,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (1/1) ... [2024-11-10 03:16:14,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:16:14,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:16:14,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:16:14,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:16:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:16:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:16:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:16:14,543 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:16:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:16:14,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:16:14,639 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:16:14,642 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:16:15,026 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:16:15,026 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:16:15,044 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:16:15,044 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:16:15,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:16:15 BoogieIcfgContainer [2024-11-10 03:16:15,045 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:16:15,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:16:15,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:16:15,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:16:15,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:16:13" (1/3) ... [2024-11-10 03:16:15,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703fefb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:16:15, skipping insertion in model container [2024-11-10 03:16:15,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:14" (2/3) ... [2024-11-10 03:16:15,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703fefb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:16:15, skipping insertion in model container [2024-11-10 03:16:15,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:16:15" (3/3) ... [2024-11-10 03:16:15,057 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-97.i [2024-11-10 03:16:15,074 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:16:15,074 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:16:15,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:16:15,158 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;@2c30d869, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:16:15,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:16:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:16:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 03:16:15,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:15,177 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:15,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:15,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:15,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1626660324, now seen corresponding path program 1 times [2024-11-10 03:16:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:16:15,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347269570] [2024-11-10 03:16:15,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:15,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:15,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:16:15,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:16:15,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:16:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:15,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:16:15,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:16:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-10 03:16:15,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:16:15,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:16:15,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347269570] [2024-11-10 03:16:15,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347269570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:16:15,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:16:15,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:16:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471704276] [2024-11-10 03:16:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:16:15,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:16:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:16:15,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:16:15,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:16:15,486 INFO L87 Difference]: Start difference. First operand has 59 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 03:16:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:15,521 INFO L93 Difference]: Finished difference Result 110 states and 183 transitions. [2024-11-10 03:16:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:16:15,524 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2024-11-10 03:16:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:15,533 INFO L225 Difference]: With dead ends: 110 [2024-11-10 03:16:15,533 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 03:16:15,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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-11-10 03:16:15,540 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:15,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:16:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 03:16:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 03:16:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:16:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-10 03:16:15,583 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 107 [2024-11-10 03:16:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:15,584 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-10 03:16:15,584 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 03:16:15,584 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-10 03:16:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 03:16:15,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:15,587 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:15,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:16:15,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:15,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:15,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1954653818, now seen corresponding path program 1 times [2024-11-10 03:16:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:16:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771088656] [2024-11-10 03:16:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:15,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:15,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:16:15,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:16:15,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:16:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:15,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 03:16:15,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:16:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:16:16,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:16:16,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:16:16,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771088656] [2024-11-10 03:16:16,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771088656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:16:16,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:16:16,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:16:16,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077993361] [2024-11-10 03:16:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:16:16,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:16:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:16:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:16:16,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:16:16,406 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:16:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:16,625 INFO L93 Difference]: Finished difference Result 190 states and 281 transitions. [2024-11-10 03:16:16,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:16:16,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-11-10 03:16:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:16,629 INFO L225 Difference]: With dead ends: 190 [2024-11-10 03:16:16,629 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 03:16:16,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:16:16,631 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 88 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:16,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 213 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:16:16,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 03:16:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 102. [2024-11-10 03:16:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 03:16:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2024-11-10 03:16:16,656 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 107 [2024-11-10 03:16:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:16,657 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2024-11-10 03:16:16,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:16:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2024-11-10 03:16:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 03:16:16,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:16,660 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:16,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 03:16:16,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:16,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:16,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1758140313, now seen corresponding path program 1 times [2024-11-10 03:16:16,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:16:16,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065605618] [2024-11-10 03:16:16,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:16,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:16,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:16:16,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:16:16,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:16:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:16,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 03:16:17,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:16:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 03:16:17,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:16:17,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:16:17,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065605618] [2024-11-10 03:16:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065605618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:16:17,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:16:17,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 03:16:17,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499020600] [2024-11-10 03:16:17,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:16:17,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 03:16:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:16:17,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 03:16:17,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:16:17,088 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:16:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:17,410 INFO L93 Difference]: Finished difference Result 158 states and 226 transitions. [2024-11-10 03:16:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 03:16:17,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-11-10 03:16:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:17,414 INFO L225 Difference]: With dead ends: 158 [2024-11-10 03:16:17,414 INFO L226 Difference]: Without dead ends: 59 [2024-11-10 03:16:17,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 03:16:17,416 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 75 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:17,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 101 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:16:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-10 03:16:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-10 03:16:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 03:16:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2024-11-10 03:16:17,432 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 107 [2024-11-10 03:16:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:17,433 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2024-11-10 03:16:17,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:16:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2024-11-10 03:16:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 03:16:17,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:17,435 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:17,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 03:16:17,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:17,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:17,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash -181284249, now seen corresponding path program 1 times [2024-11-10 03:16:17,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:16:17,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315832938] [2024-11-10 03:16:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:17,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:17,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:16:17,643 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:16:17,644 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 (5)] Waiting until timeout for monitored process [2024-11-10 03:16:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:17,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 03:16:17,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:16:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 03:16:18,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:16:18,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:16:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315832938] [2024-11-10 03:16:18,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315832938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:16:18,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:16:18,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:16:18,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355385450] [2024-11-10 03:16:18,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:16:18,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:16:18,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:16:18,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:16:18,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:16:18,289 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:16:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:16:18,442 INFO L93 Difference]: Finished difference Result 161 states and 209 transitions. [2024-11-10 03:16:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:16:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-11-10 03:16:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:16:18,445 INFO L225 Difference]: With dead ends: 161 [2024-11-10 03:16:18,445 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 03:16:18,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:16:18,450 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 37 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:16:18,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 180 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:16:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 03:16:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2024-11-10 03:16:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 03:16:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2024-11-10 03:16:18,489 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 108 [2024-11-10 03:16:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:16:18,489 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2024-11-10 03:16:18,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 03:16:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2024-11-10 03:16:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 03:16:18,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:16:18,491 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:16:18,497 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 (5)] Ended with exit code 0 [2024-11-10 03:16:18,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:18,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:16:18,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:16:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1065869087, now seen corresponding path program 1 times [2024-11-10 03:16:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:16:18,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114184476] [2024-11-10 03:16:18,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:16:18,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:16:18,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:16:18,701 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:16:18,704 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 (6)] Waiting until timeout for monitored process [2024-11-10 03:16:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:16:19,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 03:16:19,091 INFO L278 TraceCheckSpWp]: Computing forward predicates...