./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 518c7f094b355f1fdc24627237170e4bb6211eb5eb83171207629e6304c756b9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:05:53,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:05:54,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:05:54,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:05:54,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:05:54,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:05:54,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:05:54,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:05:54,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:05:54,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:05:54,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:05:54,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:05:54,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:05:54,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:05:54,070 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:05:54,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:05:54,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:05:54,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:05:54,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:05:54,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:05:54,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:05:54,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:05:54,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:05:54,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:05:54,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:05:54,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:05:54,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:05:54,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:05:54,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:05:54,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:05:54,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:05:54,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:05:54,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:05:54,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:05:54,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:05:54,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:05:54,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:05:54,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:05:54,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:05:54,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:05:54,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:05:54,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:05:54,082 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-clean/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-clean/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 -> 518c7f094b355f1fdc24627237170e4bb6211eb5eb83171207629e6304c756b9 [2024-10-11 10:05:54,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:05:54,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:05:54,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:05:54,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:05:54,398 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:05:54,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i [2024-10-11 10:05:55,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:05:56,087 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:05:56,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i [2024-10-11 10:05:56,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56206c3e4/918a233511904d30b168076627a5bac4/FLAG04b04d818 [2024-10-11 10:05:56,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56206c3e4/918a233511904d30b168076627a5bac4 [2024-10-11 10:05:56,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:05:56,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:05:56,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:05:56,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:05:56,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:05:56,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ce255d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56, skipping insertion in model container [2024-10-11 10:05:56,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:05:56,360 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i[919,932] [2024-10-11 10:05:56,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:05:56,492 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:05:56,506 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i[919,932] [2024-10-11 10:05:56,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:05:56,633 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:05:56,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56 WrapperNode [2024-10-11 10:05:56,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:05:56,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:05:56,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:05:56,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:05:56,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,729 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 273 [2024-10-11 10:05:56,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:05:56,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:05:56,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:05:56,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:05:56,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,803 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:05:56,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:05:56,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:05:56,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:05:56,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:05:56,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (1/1) ... [2024-10-11 10:05:56,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:05:56,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:05:56,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:05:56,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:05:56,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:05:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:05:56,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:05:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:05:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:05:56,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:05:57,082 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:05:57,084 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:05:57,706 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 10:05:57,706 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:05:57,747 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:05:57,749 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:05:57,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:05:57 BoogieIcfgContainer [2024-10-11 10:05:57,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:05:57,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:05:57,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:05:57,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:05:57,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:05:56" (1/3) ... [2024-10-11 10:05:57,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f487c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:05:57, skipping insertion in model container [2024-10-11 10:05:57,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:05:56" (2/3) ... [2024-10-11 10:05:57,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f487c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:05:57, skipping insertion in model container [2024-10-11 10:05:57,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:05:57" (3/3) ... [2024-10-11 10:05:57,762 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i [2024-10-11 10:05:57,780 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:05:57,780 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:05:57,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:05:57,872 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;@2207a9f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:05:57,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:05:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 76 states have (on average 1.513157894736842) internal successors, (115), 77 states have internal predecessors, (115), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:05:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 10:05:57,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:05:57,896 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:05:57,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:05:57,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:05:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash 52873702, now seen corresponding path program 1 times [2024-10-11 10:05:57,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:05:57,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718873277] [2024-10-11 10:05:57,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:05:57,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:05:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:05:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:05:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:05:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:05:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:05:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:05:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:05:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:05:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:05:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:05:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:05:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:05:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:05:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:05:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:05:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:05:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:05:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:05:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:05:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:05:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:05:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:05:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:05:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:05:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:05:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:05:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:05:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:05:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:05:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:05:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:05:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:05:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718873277] [2024-10-11 10:05:58,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718873277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:05:58,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:05:58,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:05:58,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612933751] [2024-10-11 10:05:58,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:05:58,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:05:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:05:58,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:05:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:05:58,648 INFO L87 Difference]: Start difference. First operand has 109 states, 76 states have (on average 1.513157894736842) internal successors, (115), 77 states have internal predecessors, (115), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:05:58,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:05:58,704 INFO L93 Difference]: Finished difference Result 215 states and 378 transitions. [2024-10-11 10:05:58,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:05:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 194 [2024-10-11 10:05:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:05:58,716 INFO L225 Difference]: With dead ends: 215 [2024-10-11 10:05:58,717 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 10:05:58,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:05:58,724 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:05:58,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:05:58,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 10:05:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-11 10:05:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 75 states have internal predecessors, (110), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:05:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 170 transitions. [2024-10-11 10:05:58,783 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 170 transitions. Word has length 194 [2024-10-11 10:05:58,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:05:58,784 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 170 transitions. [2024-10-11 10:05:58,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:05:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 170 transitions. [2024-10-11 10:05:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 10:05:58,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:05:58,789 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:05:58,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:05:58,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:05:58,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:05:58,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1120915802, now seen corresponding path program 1 times [2024-10-11 10:05:58,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:05:58,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376056426] [2024-10-11 10:05:58,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:05:58,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:05:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:05:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:05:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:05:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:05:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:05:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:05:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:05:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:05:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:05:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:05:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:05:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:05:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:05:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:05:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:05:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:05:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:05:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:05:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:05:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:05:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:05:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:05:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:05:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:05:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:05:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:05:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:05:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:05:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:05:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:05:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:05:59,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:05:59,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376056426] [2024-10-11 10:05:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376056426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:05:59,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:05:59,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:05:59,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008141233] [2024-10-11 10:05:59,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:05:59,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:05:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:05:59,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:05:59,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:05:59,356 INFO L87 Difference]: Start difference. First operand 107 states and 170 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:05:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:05:59,430 INFO L93 Difference]: Finished difference Result 213 states and 339 transitions. [2024-10-11 10:05:59,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:05:59,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-11 10:05:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:05:59,434 INFO L225 Difference]: With dead ends: 213 [2024-10-11 10:05:59,436 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 10:05:59,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:05:59,438 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:05:59,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:05:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 10:05:59,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-11 10:05:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 75 states have internal predecessors, (109), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:05:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 169 transitions. [2024-10-11 10:05:59,456 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 169 transitions. Word has length 194 [2024-10-11 10:05:59,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:05:59,458 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 169 transitions. [2024-10-11 10:05:59,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:05:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 169 transitions. [2024-10-11 10:05:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-11 10:05:59,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:05:59,462 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:05:59,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:05:59,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:05:59,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:05:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash 572826648, now seen corresponding path program 1 times [2024-10-11 10:05:59,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:05:59,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142844359] [2024-10-11 10:05:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:05:59,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:05:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:05:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:05:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:05:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:05:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:05:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:05:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:05:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:05:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:05:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:05:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:05:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:05:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:05:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:05:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:05:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:05:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:05:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:05:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:05:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:05:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:59,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:05:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:00,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:00,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142844359] [2024-10-11 10:06:00,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142844359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:00,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:00,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:06:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742758322] [2024-10-11 10:06:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:00,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:06:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:00,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:06:00,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:06:00,078 INFO L87 Difference]: Start difference. First operand 107 states and 169 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:00,384 INFO L93 Difference]: Finished difference Result 320 states and 506 transitions. [2024-10-11 10:06:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:06:00,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2024-10-11 10:06:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:00,389 INFO L225 Difference]: With dead ends: 320 [2024-10-11 10:06:00,389 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 10:06:00,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-10-11 10:06:00,395 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 146 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:00,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 460 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:06:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 10:06:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2024-10-11 10:06:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 135 states have (on average 1.4444444444444444) internal successors, (195), 135 states have internal predecessors, (195), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 10:06:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 315 transitions. [2024-10-11 10:06:00,445 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 315 transitions. Word has length 195 [2024-10-11 10:06:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:00,446 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 315 transitions. [2024-10-11 10:06:00,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 315 transitions. [2024-10-11 10:06:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 10:06:00,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:00,449 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:00,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:06:00,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:00,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:00,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1724438702, now seen corresponding path program 1 times [2024-10-11 10:06:00,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:00,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526807855] [2024-10-11 10:06:00,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:00,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:00,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:00,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526807855] [2024-10-11 10:06:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526807855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:06:00,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324593310] [2024-10-11 10:06:00,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:00,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:06:00,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:00,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:06:00,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:06:00,827 INFO L87 Difference]: Start difference. First operand 198 states and 315 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:01,072 INFO L93 Difference]: Finished difference Result 447 states and 704 transitions. [2024-10-11 10:06:01,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:06:01,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-10-11 10:06:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:01,078 INFO L225 Difference]: With dead ends: 447 [2024-10-11 10:06:01,080 INFO L226 Difference]: Without dead ends: 326 [2024-10-11 10:06:01,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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-10-11 10:06:01,085 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 183 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:01,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 489 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:06:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-11 10:06:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 309. [2024-10-11 10:06:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 215 states have (on average 1.4372093023255814) internal successors, (309), 215 states have internal predecessors, (309), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-11 10:06:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 489 transitions. [2024-10-11 10:06:01,156 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 489 transitions. Word has length 196 [2024-10-11 10:06:01,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:01,157 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 489 transitions. [2024-10-11 10:06:01,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 489 transitions. [2024-10-11 10:06:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 10:06:01,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:01,164 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:01,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:06:01,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:01,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:01,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1241287901, now seen corresponding path program 1 times [2024-10-11 10:06:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301630140] [2024-10-11 10:06:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:01,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:01,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301630140] [2024-10-11 10:06:01,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301630140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:01,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:01,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 10:06:01,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993457581] [2024-10-11 10:06:01,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:01,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:06:01,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:01,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:06:01,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:06:01,633 INFO L87 Difference]: Start difference. First operand 309 states and 489 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:02,056 INFO L93 Difference]: Finished difference Result 822 states and 1284 transitions. [2024-10-11 10:06:02,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 10:06:02,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2024-10-11 10:06:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:02,066 INFO L225 Difference]: With dead ends: 822 [2024-10-11 10:06:02,066 INFO L226 Difference]: Without dead ends: 601 [2024-10-11 10:06:02,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:06:02,072 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 387 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:02,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1289 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:06:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-10-11 10:06:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 539. [2024-10-11 10:06:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 383 states have (on average 1.443864229765013) internal successors, (553), 383 states have internal predecessors, (553), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-11 10:06:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 853 transitions. [2024-10-11 10:06:02,151 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 853 transitions. Word has length 197 [2024-10-11 10:06:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:02,152 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 853 transitions. [2024-10-11 10:06:02,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 853 transitions. [2024-10-11 10:06:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 10:06:02,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:02,155 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:02,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:06:02,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:02,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1921346271, now seen corresponding path program 1 times [2024-10-11 10:06:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:02,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786071117] [2024-10-11 10:06:02,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:02,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786071117] [2024-10-11 10:06:02,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786071117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:02,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:02,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:06:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584210263] [2024-10-11 10:06:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:02,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:06:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:02,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:06:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:06:02,740 INFO L87 Difference]: Start difference. First operand 539 states and 853 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:03,008 INFO L93 Difference]: Finished difference Result 1059 states and 1660 transitions. [2024-10-11 10:06:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:06:03,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2024-10-11 10:06:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:03,014 INFO L225 Difference]: With dead ends: 1059 [2024-10-11 10:06:03,014 INFO L226 Difference]: Without dead ends: 597 [2024-10-11 10:06:03,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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-10-11 10:06:03,018 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 138 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:03,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 460 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:06:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-10-11 10:06:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 547. [2024-10-11 10:06:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 391 states have (on average 1.432225063938619) internal successors, (560), 391 states have internal predecessors, (560), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-11 10:06:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 860 transitions. [2024-10-11 10:06:03,089 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 860 transitions. Word has length 197 [2024-10-11 10:06:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:03,094 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 860 transitions. [2024-10-11 10:06:03,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 860 transitions. [2024-10-11 10:06:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 10:06:03,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:03,097 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:03,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:06:03,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:03,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:03,099 INFO L85 PathProgramCache]: Analyzing trace with hash -406464877, now seen corresponding path program 1 times [2024-10-11 10:06:03,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:03,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105393661] [2024-10-11 10:06:03,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:03,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:03,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105393661] [2024-10-11 10:06:03,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105393661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:03,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:03,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:06:03,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872978264] [2024-10-11 10:06:03,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:03,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:06:03,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:03,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:06:03,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:06:03,666 INFO L87 Difference]: Start difference. First operand 547 states and 860 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:06:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:03,964 INFO L93 Difference]: Finished difference Result 832 states and 1295 transitions. [2024-10-11 10:06:03,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:06:03,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2024-10-11 10:06:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:03,969 INFO L225 Difference]: With dead ends: 832 [2024-10-11 10:06:03,969 INFO L226 Difference]: Without dead ends: 611 [2024-10-11 10:06:03,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:06:03,971 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 218 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:03,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 381 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:06:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-10-11 10:06:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 575. [2024-10-11 10:06:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 419 states have (on average 1.431980906921241) internal successors, (600), 419 states have internal predecessors, (600), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-11 10:06:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 900 transitions. [2024-10-11 10:06:04,030 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 900 transitions. Word has length 198 [2024-10-11 10:06:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:04,031 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 900 transitions. [2024-10-11 10:06:04,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:06:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 900 transitions. [2024-10-11 10:06:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 10:06:04,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:04,034 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:04,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:06:04,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:04,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1215811503, now seen corresponding path program 1 times [2024-10-11 10:06:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:04,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214835627] [2024-10-11 10:06:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214835627] [2024-10-11 10:06:04,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214835627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:04,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:04,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:06:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473806190] [2024-10-11 10:06:04,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:04,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:06:04,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:04,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:06:04,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:06:04,475 INFO L87 Difference]: Start difference. First operand 575 states and 900 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:04,557 INFO L93 Difference]: Finished difference Result 1025 states and 1607 transitions. [2024-10-11 10:06:04,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:06:04,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-10-11 10:06:04,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:04,562 INFO L225 Difference]: With dead ends: 1025 [2024-10-11 10:06:04,562 INFO L226 Difference]: Without dead ends: 547 [2024-10-11 10:06:04,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:06:04,566 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 70 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:04,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 311 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:06:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-11 10:06:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2024-10-11 10:06:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 391 states have (on average 1.4296675191815857) internal successors, (559), 391 states have internal predecessors, (559), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-11 10:06:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 859 transitions. [2024-10-11 10:06:04,618 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 859 transitions. Word has length 198 [2024-10-11 10:06:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:04,618 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 859 transitions. [2024-10-11 10:06:04,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 859 transitions. [2024-10-11 10:06:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 10:06:04,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:04,623 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:04,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:06:04,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:04,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2083064085, now seen corresponding path program 1 times [2024-10-11 10:06:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:04,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340848426] [2024-10-11 10:06:04,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:04,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:04,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:05,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:05,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340848426] [2024-10-11 10:06:05,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340848426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:05,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:05,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:06:05,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621820021] [2024-10-11 10:06:05,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:05,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:06:05,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:05,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:06:05,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:06:05,145 INFO L87 Difference]: Start difference. First operand 547 states and 859 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:05,532 INFO L93 Difference]: Finished difference Result 1325 states and 2067 transitions. [2024-10-11 10:06:05,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:06:05,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-10-11 10:06:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:05,539 INFO L225 Difference]: With dead ends: 1325 [2024-10-11 10:06:05,540 INFO L226 Difference]: Without dead ends: 845 [2024-10-11 10:06:05,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:06:05,543 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 176 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:05,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 639 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:06:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-11 10:06:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 761. [2024-10-11 10:06:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 543 states have (on average 1.4180478821362799) internal successors, (770), 543 states have internal predecessors, (770), 210 states have call successors, (210), 7 states have call predecessors, (210), 7 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-10-11 10:06:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1190 transitions. [2024-10-11 10:06:05,638 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1190 transitions. Word has length 198 [2024-10-11 10:06:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:05,639 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1190 transitions. [2024-10-11 10:06:05,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1190 transitions. [2024-10-11 10:06:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 10:06:05,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:05,642 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:05,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 10:06:05,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:05,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1789201385, now seen corresponding path program 1 times [2024-10-11 10:06:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660860301] [2024-10-11 10:06:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:06,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:06,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660860301] [2024-10-11 10:06:06,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660860301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:06,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:06,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:06:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334125386] [2024-10-11 10:06:06,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:06,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:06:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:06,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:06:06,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:06:06,063 INFO L87 Difference]: Start difference. First operand 761 states and 1190 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:06,277 INFO L93 Difference]: Finished difference Result 1539 states and 2408 transitions. [2024-10-11 10:06:06,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:06:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-10-11 10:06:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:06,284 INFO L225 Difference]: With dead ends: 1539 [2024-10-11 10:06:06,284 INFO L226 Difference]: Without dead ends: 905 [2024-10-11 10:06:06,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:06:06,289 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 37 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:06,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 780 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:06:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-10-11 10:06:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 839. [2024-10-11 10:06:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 621 states have (on average 1.4122383252818036) internal successors, (877), 621 states have internal predecessors, (877), 210 states have call successors, (210), 7 states have call predecessors, (210), 7 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-10-11 10:06:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1297 transitions. [2024-10-11 10:06:06,395 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1297 transitions. Word has length 198 [2024-10-11 10:06:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:06,397 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1297 transitions. [2024-10-11 10:06:06,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1297 transitions. [2024-10-11 10:06:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-11 10:06:06,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:06,400 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:06,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 10:06:06,400 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:06,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1565259347, now seen corresponding path program 1 times [2024-10-11 10:06:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:06,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131948769] [2024-10-11 10:06:06,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:06,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 10:06:06,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:06,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131948769] [2024-10-11 10:06:06,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131948769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:06:06,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839463336] [2024-10-11 10:06:06,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:06,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:06:06,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:06:06,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:06:06,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:06:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:06,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:06:06,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:06:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-10-11 10:06:07,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:06:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 10:06:07,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839463336] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:06:07,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:06:07,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 10:06:07,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680895347] [2024-10-11 10:06:07,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:06:07,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:06:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:07,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:06:07,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:06:07,418 INFO L87 Difference]: Start difference. First operand 839 states and 1297 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-10-11 10:06:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:07,753 INFO L93 Difference]: Finished difference Result 1663 states and 2539 transitions. [2024-10-11 10:06:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:06:07,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 203 [2024-10-11 10:06:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:07,760 INFO L225 Difference]: With dead ends: 1663 [2024-10-11 10:06:07,761 INFO L226 Difference]: Without dead ends: 881 [2024-10-11 10:06:07,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 461 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:06:07,765 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 203 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:07,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 300 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:06:07,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-10-11 10:06:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 867. [2024-10-11 10:06:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 642 states have (on average 1.355140186915888) internal successors, (870), 642 states have internal predecessors, (870), 210 states have call successors, (210), 14 states have call predecessors, (210), 14 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-10-11 10:06:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1290 transitions. [2024-10-11 10:06:07,884 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1290 transitions. Word has length 203 [2024-10-11 10:06:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:07,884 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1290 transitions. [2024-10-11 10:06:07,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2024-10-11 10:06:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1290 transitions. [2024-10-11 10:06:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 10:06:07,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:07,887 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:07,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:06:08,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 10:06:08,088 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:08,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:08,089 INFO L85 PathProgramCache]: Analyzing trace with hash -229004874, now seen corresponding path program 1 times [2024-10-11 10:06:08,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:08,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861595312] [2024-10-11 10:06:08,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:08,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:08,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:08,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861595312] [2024-10-11 10:06:08,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861595312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:08,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:08,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:06:08,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500364549] [2024-10-11 10:06:08,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:08,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:06:08,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:08,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:06:08,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:06:08,236 INFO L87 Difference]: Start difference. First operand 867 states and 1290 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:08,402 INFO L93 Difference]: Finished difference Result 2349 states and 3472 transitions. [2024-10-11 10:06:08,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:06:08,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 206 [2024-10-11 10:06:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:08,414 INFO L225 Difference]: With dead ends: 2349 [2024-10-11 10:06:08,415 INFO L226 Difference]: Without dead ends: 1548 [2024-10-11 10:06:08,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:06:08,419 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 128 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:08,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 362 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:06:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-10-11 10:06:08,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1540. [2024-10-11 10:06:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1182 states have (on average 1.3553299492385786) internal successors, (1602), 1188 states have internal predecessors, (1602), 330 states have call successors, (330), 27 states have call predecessors, (330), 27 states have return successors, (330), 324 states have call predecessors, (330), 330 states have call successors, (330) [2024-10-11 10:06:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2262 transitions. [2024-10-11 10:06:08,612 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2262 transitions. Word has length 206 [2024-10-11 10:06:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:08,613 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 2262 transitions. [2024-10-11 10:06:08,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2262 transitions. [2024-10-11 10:06:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 10:06:08,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:08,615 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:08,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 10:06:08,616 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:08,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash -623371660, now seen corresponding path program 1 times [2024-10-11 10:06:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:08,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312434453] [2024-10-11 10:06:08,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:08,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:08,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312434453] [2024-10-11 10:06:08,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312434453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:08,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:08,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:06:08,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390077732] [2024-10-11 10:06:08,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:08,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:06:08,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:08,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:06:08,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:06:08,959 INFO L87 Difference]: Start difference. First operand 1540 states and 2262 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:09,442 INFO L93 Difference]: Finished difference Result 3448 states and 5071 transitions. [2024-10-11 10:06:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:06:09,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 206 [2024-10-11 10:06:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:09,458 INFO L225 Difference]: With dead ends: 3448 [2024-10-11 10:06:09,459 INFO L226 Difference]: Without dead ends: 2048 [2024-10-11 10:06:09,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:06:09,465 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 187 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:09,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 578 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:06:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2024-10-11 10:06:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2046. [2024-10-11 10:06:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 1571 states have (on average 1.3570973901973264) internal successors, (2132), 1579 states have internal predecessors, (2132), 430 states have call successors, (430), 44 states have call predecessors, (430), 44 states have return successors, (430), 422 states have call predecessors, (430), 430 states have call successors, (430) [2024-10-11 10:06:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2992 transitions. [2024-10-11 10:06:09,757 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2992 transitions. Word has length 206 [2024-10-11 10:06:09,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:09,758 INFO L471 AbstractCegarLoop]: Abstraction has 2046 states and 2992 transitions. [2024-10-11 10:06:09,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:09,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2992 transitions. [2024-10-11 10:06:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 10:06:09,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:09,761 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:09,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 10:06:09,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:09,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1324971534, now seen corresponding path program 1 times [2024-10-11 10:06:09,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:09,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262739363] [2024-10-11 10:06:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:09,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 10:06:10,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:10,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262739363] [2024-10-11 10:06:10,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262739363] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:06:10,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490041320] [2024-10-11 10:06:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:10,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:06:10,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:06:10,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:06:10,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 10:06:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:10,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:06:10,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:06:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 789 proven. 27 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:06:10,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:06:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 10:06:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490041320] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:06:10,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:06:10,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 10:06:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974968839] [2024-10-11 10:06:10,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:06:10,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:06:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:10,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:06:10,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:06:10,614 INFO L87 Difference]: Start difference. First operand 2046 states and 2992 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2024-10-11 10:06:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:11,048 INFO L93 Difference]: Finished difference Result 3228 states and 4666 transitions. [2024-10-11 10:06:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:06:11,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 206 [2024-10-11 10:06:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:11,058 INFO L225 Difference]: With dead ends: 3228 [2024-10-11 10:06:11,059 INFO L226 Difference]: Without dead ends: 1253 [2024-10-11 10:06:11,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 467 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:06:11,065 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 112 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:11,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 288 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:06:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2024-10-11 10:06:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1217. [2024-10-11 10:06:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 905 states have (on average 1.312707182320442) internal successors, (1188), 905 states have internal predecessors, (1188), 270 states have call successors, (270), 41 states have call predecessors, (270), 41 states have return successors, (270), 270 states have call predecessors, (270), 270 states have call successors, (270) [2024-10-11 10:06:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1728 transitions. [2024-10-11 10:06:11,240 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1728 transitions. Word has length 206 [2024-10-11 10:06:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:11,240 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1728 transitions. [2024-10-11 10:06:11,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2024-10-11 10:06:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1728 transitions. [2024-10-11 10:06:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 10:06:11,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:11,243 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:11,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 10:06:11,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:06:11,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:11,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1327098897, now seen corresponding path program 1 times [2024-10-11 10:06:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:11,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862912322] [2024-10-11 10:06:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:11,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:06:11,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [773206298] [2024-10-11 10:06:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:11,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:06:11,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:06:11,536 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:06:11,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 10:06:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:11,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 10:06:11,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:06:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 347 proven. 78 refuted. 0 times theorem prover too weak. 1315 trivial. 0 not checked. [2024-10-11 10:06:12,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:06:13,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:13,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862912322] [2024-10-11 10:06:13,530 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 10:06:13,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773206298] [2024-10-11 10:06:13,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773206298] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:06:13,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 10:06:13,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-10-11 10:06:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198870249] [2024-10-11 10:06:13,531 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 10:06:13,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:06:13,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:13,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:06:13,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:06:13,533 INFO L87 Difference]: Start difference. First operand 1217 states and 1728 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:06:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:14,393 INFO L93 Difference]: Finished difference Result 2720 states and 3817 transitions. [2024-10-11 10:06:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 10:06:14,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 208 [2024-10-11 10:06:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:14,407 INFO L225 Difference]: With dead ends: 2720 [2024-10-11 10:06:14,407 INFO L226 Difference]: Without dead ends: 2149 [2024-10-11 10:06:14,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-10-11 10:06:14,412 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 164 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:14,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 603 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:06:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2024-10-11 10:06:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2079. [2024-10-11 10:06:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 1539 states have (on average 1.3034437946718649) internal successors, (2006), 1543 states have internal predecessors, (2006), 458 states have call successors, (458), 81 states have call predecessors, (458), 81 states have return successors, (458), 454 states have call predecessors, (458), 458 states have call successors, (458) [2024-10-11 10:06:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 2922 transitions. [2024-10-11 10:06:14,677 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 2922 transitions. Word has length 208 [2024-10-11 10:06:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:14,678 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 2922 transitions. [2024-10-11 10:06:14,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:06:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2922 transitions. [2024-10-11 10:06:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 10:06:14,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:14,680 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:14,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 10:06:14,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:06:14,885 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:14,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:14,886 INFO L85 PathProgramCache]: Analyzing trace with hash 649272405, now seen corresponding path program 1 times [2024-10-11 10:06:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499707449] [2024-10-11 10:06:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:06:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:06:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:06:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:06:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:06:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:06:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:06:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:06:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:06:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:06:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:06:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:06:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:06:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:06:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:06:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:06:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:06:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:06:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:06:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:06:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:06:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:06:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:06:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:06:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:06:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:06:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:06:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:06:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:06:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:06:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:06:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499707449] [2024-10-11 10:06:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499707449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:15,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:06:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299926075] [2024-10-11 10:06:15,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:15,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:06:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:06:15,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:06:15,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:06:15,240 INFO L87 Difference]: Start difference. First operand 2079 states and 2922 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:15,525 INFO L93 Difference]: Finished difference Result 3223 states and 4548 transitions. [2024-10-11 10:06:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:06:15,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 208 [2024-10-11 10:06:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:15,540 INFO L225 Difference]: With dead ends: 3223 [2024-10-11 10:06:15,540 INFO L226 Difference]: Without dead ends: 2090 [2024-10-11 10:06:15,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:06:15,545 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 94 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:15,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 473 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:06:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2024-10-11 10:06:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2024-10-11 10:06:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 1548 states have (on average 1.3016795865633075) internal successors, (2015), 1552 states have internal predecessors, (2015), 458 states have call successors, (458), 81 states have call predecessors, (458), 81 states have return successors, (458), 454 states have call predecessors, (458), 458 states have call successors, (458) [2024-10-11 10:06:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2931 transitions. [2024-10-11 10:06:15,801 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2931 transitions. Word has length 208 [2024-10-11 10:06:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:15,801 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2931 transitions. [2024-10-11 10:06:15,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:15,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2931 transitions. [2024-10-11 10:06:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 10:06:15,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:15,806 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:15,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 10:06:15,807 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:15,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash -361844845, now seen corresponding path program 1 times [2024-10-11 10:06:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:06:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953929773] [2024-10-11 10:06:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:06:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:06:15,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [977053139] [2024-10-11 10:06:15,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:15,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:06:15,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:06:15,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:06:15,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 10:06:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:06:16,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:06:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:06:16,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:06:16,226 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:06:16,227 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:06:16,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 10:06:16,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 10:06:16,433 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:16,569 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:06:16,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:06:16 BoogieIcfgContainer [2024-10-11 10:06:16,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:06:16,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:06:16,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:06:16,574 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:06:16,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:05:57" (3/4) ... [2024-10-11 10:06:16,576 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:06:16,577 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:06:16,578 INFO L158 Benchmark]: Toolchain (without parser) took 20453.29ms. Allocated memory was 138.4MB in the beginning and 513.8MB in the end (delta: 375.4MB). Free memory was 67.5MB in the beginning and 226.2MB in the end (delta: -158.7MB). Peak memory consumption was 218.5MB. Max. memory is 16.1GB. [2024-10-11 10:06:16,578 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 138.4MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:06:16,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.61ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 67.2MB in the beginning and 142.6MB in the end (delta: -75.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-10-11 10:06:16,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.86ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 134.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 10:06:16,579 INFO L158 Benchmark]: Boogie Preprocessor took 138.55ms. Allocated memory is still 176.2MB. Free memory was 134.2MB in the beginning and 121.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 10:06:16,579 INFO L158 Benchmark]: RCFGBuilder took 878.94ms. Allocated memory is still 176.2MB. Free memory was 121.6MB in the beginning and 75.5MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-11 10:06:16,579 INFO L158 Benchmark]: TraceAbstraction took 18820.11ms. Allocated memory was 176.2MB in the beginning and 513.8MB in the end (delta: 337.6MB). Free memory was 75.5MB in the beginning and 226.2MB in the end (delta: -150.7MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. [2024-10-11 10:06:16,580 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 513.8MB. Free memory is still 226.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:06:16,584 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.09ms. Allocated memory is still 138.4MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.61ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 67.2MB in the beginning and 142.6MB in the end (delta: -75.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.86ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 134.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.55ms. Allocated memory is still 176.2MB. Free memory was 134.2MB in the beginning and 121.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 878.94ms. Allocated memory is still 176.2MB. Free memory was 121.6MB in the beginning and 75.5MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18820.11ms. Allocated memory was 176.2MB in the beginning and 513.8MB in the end (delta: 337.6MB). Free memory was 75.5MB in the beginning and 226.2MB in the end (delta: -150.7MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 513.8MB. Free memory is still 226.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 someBinaryDOUBLEComparisonOperation at line 183, overapproximation of bitwiseOr at line 183, overapproximation of someBinaryArithmeticDOUBLEoperation at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned short int var_1_24 = 8; [L43] unsigned short int var_1_26 = 26914; [L44] unsigned short int var_1_27 = 26182; [L45] unsigned char var_1_28 = 5; [L46] unsigned char var_1_29 = 50; [L47] unsigned char var_1_30 = 10; [L48] signed long int var_1_31 = -32; [L49] unsigned char var_1_32 = 0; [L50] unsigned char var_1_33 = 1; [L51] unsigned char var_1_34 = 0; [L52] signed long int var_1_35 = 1000000; [L53] signed long int var_1_36 = 64; [L54] unsigned char last_1_var_1_3 = 64; [L55] unsigned short int last_1_var_1_6 = 10; [L56] unsigned short int last_1_var_1_15 = 5; [L57] unsigned short int last_1_var_1_20 = 50; [L58] unsigned short int last_1_var_1_21 = 0; [L187] isInitial = 1 [L188] FCALL initially() [L189] COND TRUE 1 [L190] CALL updateLastVariables() [L176] last_1_var_1_3 = var_1_3 [L177] last_1_var_1_6 = var_1_6 [L178] last_1_var_1_15 = var_1_15 [L179] last_1_var_1_20 = var_1_20 [L180] last_1_var_1_21 = var_1_21 [L190] RET updateLastVariables() [L191] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L128] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L129] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L129] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] var_1_5 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] var_1_9 = __VERIFIER_nondet_long() [L134] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L134] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L135] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L135] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L136] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L136] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L137] var_1_10 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L138] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L139] var_1_11 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L140] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L141] var_1_12 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L142] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L143] var_1_13 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L144] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L145] var_1_14 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L146] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L147] var_1_17 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L148] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L149] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L149] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L150] var_1_18 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L151] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L152] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L152] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L153] var_1_19 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L154] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L155] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L155] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L156] var_1_26 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_26 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L157] RET assume_abort_if_not(var_1_26 >= 16383) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L158] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L158] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L159] var_1_27 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_27 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L160] RET assume_abort_if_not(var_1_27 >= 16384) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L161] CALL assume_abort_if_not(var_1_27 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L161] RET assume_abort_if_not(var_1_27 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L162] var_1_29 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L163] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L164] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L164] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L165] var_1_30 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L166] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L167] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L167] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L168] var_1_33 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_33 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L169] RET assume_abort_if_not(var_1_33 >= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L170] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L170] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L171] var_1_34 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L172] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L173] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L173] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L191] RET updateVariables() [L192] CALL step() [L62] var_1_22 = var_1_5 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L63] COND TRUE ((((var_1_5) < (var_1_4)) ? (var_1_5) : (var_1_4))) >= var_1_1 [L64] var_1_24 = ((var_1_26 + var_1_27) - var_1_4) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L66] COND TRUE var_1_27 > 0 [L67] var_1_28 = (((((((((var_1_29 + var_1_30)) > (var_1_5)) ? ((var_1_29 + var_1_30)) : (var_1_5)))) < (0)) ? ((((((var_1_29 + var_1_30)) > (var_1_5)) ? ((var_1_29 + var_1_30)) : (var_1_5)))) : (0))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L69] COND TRUE var_1_26 != 10 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L70] COND FALSE !(var_1_26 <= var_1_29) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L74] COND TRUE var_1_26 > 100 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L75] EXPR ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L75] COND FALSE !((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26) > var_1_6) [L78] var_1_32 = var_1_34 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L81] var_1_35 = ((((var_1_26) > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) ? (var_1_26) : (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L82] COND FALSE !(var_1_29 > var_1_30) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] COND FALSE !(var_1_21 >= var_1_20) [L92] var_1_36 = var_1_4 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L95] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L96] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L99] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L99] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L100] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=131, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=131, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L104] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L108] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=141, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L110] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=141, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_9=66] [L116] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L117] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L118] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=141, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_9=66] [L119] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=141, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_9=66] [L119] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L122] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L123] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=262, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=141, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_9=66] [L192] RET step() [L193] CALL, EXPR property() [L183] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=262, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=141, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_9=66] [L183] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=262, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=141, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_9=66] [L183] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=262, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=141, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_9=66] [L183] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=262, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=141, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_9=66] [L183-L184] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=262, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=141, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=262, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=141, var_1_21=0, var_1_22=131, var_1_24=32637, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=131, var_1_3=64, var_1_4=131, var_1_5=131, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 17, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2285 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2243 mSDsluCounter, 8064 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5391 mSDsCounter, 611 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1797 IncrementalHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 611 mSolverCounterUnsat, 2673 mSDtfsCounter, 1797 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2090 GetRequests, 2005 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2088occurred in iteration=16, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 463 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 4235 NumberOfCodeBlocks, 4235 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4000 ConstructedInterpolants, 0 QuantifiedInterpolants, 13326 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1421 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 20 InterpolantComputations, 13 PerfectInterpolantSequences, 34542/34800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:06:16,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 518c7f094b355f1fdc24627237170e4bb6211eb5eb83171207629e6304c756b9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:06:18,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:06:19,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:06:19,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:06:19,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:06:19,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:06:19,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:06:19,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:06:19,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:06:19,126 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:06:19,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:06:19,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:06:19,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:06:19,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:06:19,128 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:06:19,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:06:19,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:06:19,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:06:19,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:06:19,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:06:19,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:06:19,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:06:19,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:06:19,132 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:06:19,133 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:06:19,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:06:19,134 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:06:19,134 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:06:19,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:06:19,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:06:19,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:06:19,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:06:19,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:06:19,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:06:19,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:06:19,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:06:19,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:06:19,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:06:19,138 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:06:19,138 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:06:19,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:06:19,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:06:19,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:06:19,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:06:19,139 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:06:19,139 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-clean/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-clean/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 -> 518c7f094b355f1fdc24627237170e4bb6211eb5eb83171207629e6304c756b9 [2024-10-11 10:06:19,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:06:19,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:06:19,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:06:19,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:06:19,541 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:06:19,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i [2024-10-11 10:06:21,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:06:21,361 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:06:21,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i [2024-10-11 10:06:21,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/570be1d55/4558726620bf40139a17c29e7a8b8134/FLAG4f86f2ab4 [2024-10-11 10:06:21,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/570be1d55/4558726620bf40139a17c29e7a8b8134 [2024-10-11 10:06:21,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:06:21,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:06:21,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:06:21,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:06:21,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:06:21,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31cc43d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21, skipping insertion in model container [2024-10-11 10:06:21,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:06:21,641 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i[919,932] [2024-10-11 10:06:21,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:06:21,750 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:06:21,762 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i[919,932] [2024-10-11 10:06:21,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:06:21,821 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:06:21,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21 WrapperNode [2024-10-11 10:06:21,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:06:21,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:06:21,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:06:21,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:06:21,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,893 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-10-11 10:06:21,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:06:21,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:06:21,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:06:21,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:06:21,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,939 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:06:21,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:06:21,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:06:21,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:06:21,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:06:21,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (1/1) ... [2024-10-11 10:06:21,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:06:22,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:06:22,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:06:22,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:06:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:06:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:06:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:06:22,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:06:22,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:06:22,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:06:22,216 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:06:22,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:06:28,905 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:06:28,905 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:06:28,994 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:06:28,994 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:06:28,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:06:28 BoogieIcfgContainer [2024-10-11 10:06:28,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:06:28,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:06:28,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:06:29,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:06:29,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:06:21" (1/3) ... [2024-10-11 10:06:29,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27195cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:06:29, skipping insertion in model container [2024-10-11 10:06:29,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:06:21" (2/3) ... [2024-10-11 10:06:29,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27195cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:06:29, skipping insertion in model container [2024-10-11 10:06:29,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:06:28" (3/3) ... [2024-10-11 10:06:29,010 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-78.i [2024-10-11 10:06:29,029 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:06:29,030 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:06:29,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:06:29,109 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;@3686ecb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:06:29,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:06:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:06:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 10:06:29,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:29,134 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:29,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:29,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1929947893, now seen corresponding path program 1 times [2024-10-11 10:06:29,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:06:29,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945158992] [2024-10-11 10:06:29,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:29,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:06:29,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:06:29,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:06:29,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:06:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:29,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:06:29,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:06:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-10-11 10:06:29,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:06:29,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:06:29,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945158992] [2024-10-11 10:06:29,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945158992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:29,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:29,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:06:29,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576276765] [2024-10-11 10:06:29,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:29,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:06:29,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:06:29,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:06:29,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:06:29,765 INFO L87 Difference]: Start difference. First operand has 81 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:06:33,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:06:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:33,027 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2024-10-11 10:06:33,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:06:33,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 188 [2024-10-11 10:06:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:33,084 INFO L225 Difference]: With dead ends: 159 [2024-10-11 10:06:33,084 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 10:06:33,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:06:33,090 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:33,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 10:06:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 10:06:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 10:06:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:06:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2024-10-11 10:06:33,136 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 188 [2024-10-11 10:06:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:33,137 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2024-10-11 10:06:33,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:06:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2024-10-11 10:06:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 10:06:33,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:33,142 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:33,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:06:33,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:06:33,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:33,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:33,344 INFO L85 PathProgramCache]: Analyzing trace with hash -469236865, now seen corresponding path program 1 times [2024-10-11 10:06:33,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:06:33,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28660890] [2024-10-11 10:06:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:33,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:06:33,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:06:33,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:06:33,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:06:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:33,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 10:06:33,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:06:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 60 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-10-11 10:06:35,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:06:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 10:06:36,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:06:36,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28660890] [2024-10-11 10:06:36,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28660890] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:06:36,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:06:36,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2024-10-11 10:06:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797721767] [2024-10-11 10:06:36,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:06:36,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:06:36,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:06:36,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:06:36,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:06:36,816 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-10-11 10:06:42,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:06:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:06:43,147 INFO L93 Difference]: Finished difference Result 167 states and 255 transitions. [2024-10-11 10:06:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 10:06:43,181 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 188 [2024-10-11 10:06:43,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:06:43,183 INFO L225 Difference]: With dead ends: 167 [2024-10-11 10:06:43,184 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 10:06:43,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:06:43,188 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 68 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:06:43,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 182 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 185 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2024-10-11 10:06:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 10:06:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-10-11 10:06:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:06:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2024-10-11 10:06:43,209 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 188 [2024-10-11 10:06:43,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:06:43,210 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2024-10-11 10:06:43,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-10-11 10:06:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2024-10-11 10:06:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 10:06:43,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:06:43,213 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:06:43,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:06:43,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:06:43,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:06:43,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:06:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1466992381, now seen corresponding path program 1 times [2024-10-11 10:06:43,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:06:43,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141869042] [2024-10-11 10:06:43,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:06:43,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:06:43,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:06:43,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:06:43,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:06:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:06:43,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:06:43,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:06:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:06:47,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:06:47,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:06:47,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141869042] [2024-10-11 10:06:47,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141869042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:06:47,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:06:47,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:06:47,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007855727] [2024-10-11 10:06:47,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:06:47,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:06:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:06:47,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:06:47,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:06:47,835 INFO L87 Difference]: Start difference. First operand 87 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:06:52,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:06:55,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:06:59,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:02,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:06,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:07:06,876 INFO L93 Difference]: Finished difference Result 271 states and 395 transitions. [2024-10-11 10:07:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:07:06,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-10-11 10:07:06,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:07:06,936 INFO L225 Difference]: With dead ends: 271 [2024-10-11 10:07:06,936 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 10:07:06,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:07:06,939 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 85 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2024-10-11 10:07:06,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 398 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 112 Invalid, 3 Unknown, 0 Unchecked, 18.9s Time] [2024-10-11 10:07:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 10:07:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2024-10-11 10:07:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 10:07:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 251 transitions. [2024-10-11 10:07:07,002 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 251 transitions. Word has length 190 [2024-10-11 10:07:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:07:07,003 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 251 transitions. [2024-10-11 10:07:07,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:07:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 251 transitions. [2024-10-11 10:07:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 10:07:07,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:07,011 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:07:07,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 10:07:07,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:07,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:07,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash -765927803, now seen corresponding path program 1 times [2024-10-11 10:07:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:07:07,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019874010] [2024-10-11 10:07:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:07,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:07,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:07:07,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:07:07,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:07:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:07,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:07:07,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:07:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:07:07,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:07:07,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:07:07,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019874010] [2024-10-11 10:07:07,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019874010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:07:07,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:07:07,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:07:07,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903080560] [2024-10-11 10:07:07,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:07:07,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:07:07,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:07:07,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:07:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:07:07,728 INFO L87 Difference]: Start difference. First operand 171 states and 251 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:07:11,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:07:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:07:11,261 INFO L93 Difference]: Finished difference Result 257 states and 377 transitions. [2024-10-11 10:07:11,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:07:11,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-10-11 10:07:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:07:11,296 INFO L225 Difference]: With dead ends: 257 [2024-10-11 10:07:11,296 INFO L226 Difference]: Without dead ends: 171 [2024-10-11 10:07:11,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:07:11,302 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:07:11,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 10:07:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-11 10:07:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-11 10:07:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 104 states have internal predecessors, (129), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 10:07:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 249 transitions. [2024-10-11 10:07:11,361 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 249 transitions. Word has length 190 [2024-10-11 10:07:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:07:11,362 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 249 transitions. [2024-10-11 10:07:11,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:07:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 249 transitions. [2024-10-11 10:07:11,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-11 10:07:11,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:07:11,370 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:07:11,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:07:11,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:11,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:07:11,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:07:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash -154156374, now seen corresponding path program 1 times [2024-10-11 10:07:11,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:07:11,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218796097] [2024-10-11 10:07:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:07:11,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:07:11,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:07:11,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:07:11,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:07:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:07:11,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:07:11,964 INFO L278 TraceCheckSpWp]: Computing forward predicates...