./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:47:46,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:47:46,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:47:46,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:47:46,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:47:46,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:47:46,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:47:46,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:47:46,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:47:46,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:47:46,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:47:46,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:47:46,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:47:46,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:47:46,920 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:47:46,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:47:46,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:47:46,922 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:47:46,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:47:46,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:47:46,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:47:46,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:47:46,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:47:46,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:47:46,929 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:47:46,929 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:47:46,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:47:46,930 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:47:46,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:47:46,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:47:46,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:47:46,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:47:46,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:47:46,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:47:46,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:47:46,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:47:46,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:47:46,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:47:46,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:47:46,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:47:46,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:47:46,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:47:46,935 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b [2024-11-08 21:47:47,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:47:47,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:47:47,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:47:47,232 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:47:47,232 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:47:47,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-08 21:47:48,699 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:47:48,897 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:47:48,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-08 21:47:48,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fea69ec2/383b9b71bfe141538b3aabb99eb69fe6/FLAG60488bb45 [2024-11-08 21:47:49,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fea69ec2/383b9b71bfe141538b3aabb99eb69fe6 [2024-11-08 21:47:49,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:47:49,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:47:49,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:49,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:47:49,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:47:49,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e033dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49, skipping insertion in model container [2024-11-08 21:47:49,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:47:49,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i[919,932] [2024-11-08 21:47:49,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:49,541 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:47:49,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i[919,932] [2024-11-08 21:47:49,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:49,630 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:47:49,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49 WrapperNode [2024-11-08 21:47:49,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:49,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:49,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:47:49,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:47:49,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,701 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2024-11-08 21:47:49,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:49,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:47:49,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:47:49,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:47:49,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,756 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:47:49,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:47:49,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:47:49,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:47:49,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:47:49,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (1/1) ... [2024-11-08 21:47:49,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:47:49,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:49,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:47:49,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:47:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:47:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:47:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:47:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:47:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:47:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:47:49,989 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:47:49,992 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:47:50,600 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 21:47:50,600 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:47:50,615 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:47:50,616 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:47:50,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:50 BoogieIcfgContainer [2024-11-08 21:47:50,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:47:50,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:47:50,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:47:50,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:47:50,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:47:49" (1/3) ... [2024-11-08 21:47:50,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103a8811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:50, skipping insertion in model container [2024-11-08 21:47:50,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:49" (2/3) ... [2024-11-08 21:47:50,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103a8811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:50, skipping insertion in model container [2024-11-08 21:47:50,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:50" (3/3) ... [2024-11-08 21:47:50,626 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-08 21:47:50,641 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:47:50,641 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:47:50,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:47:50,719 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;@299d5091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:47:50,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:47:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 79 states have internal predecessors, (121), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 21:47:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 21:47:50,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:50,739 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:50,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:50,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash -812728208, now seen corresponding path program 1 times [2024-11-08 21:47:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:50,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73259986] [2024-11-08 21:47:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:50,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:47:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:47:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:47:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:47:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:47:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:47:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:47:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:47:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:47:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:47:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:47:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:47:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-08 21:47:51,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73259986] [2024-11-08 21:47:51,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73259986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:47:51,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144433830] [2024-11-08 21:47:51,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:51,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:51,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:51,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:47:51,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:47:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:52,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 21:47:52,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:47:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 422 proven. 63 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-11-08 21:47:52,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:47:52,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144433830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:47:52,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:47:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2024-11-08 21:47:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527189254] [2024-11-08 21:47:52,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:47:52,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 21:47:52,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:53,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 21:47:53,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-08 21:47:53,009 INFO L87 Difference]: Start difference. First operand has 102 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 79 states have internal predecessors, (121), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-08 21:47:54,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:54,394 INFO L93 Difference]: Finished difference Result 324 states and 560 transitions. [2024-11-08 21:47:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-08 21:47:54,397 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 145 [2024-11-08 21:47:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:54,411 INFO L225 Difference]: With dead ends: 324 [2024-11-08 21:47:54,411 INFO L226 Difference]: Without dead ends: 225 [2024-11-08 21:47:54,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=493, Invalid=1669, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 21:47:54,423 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 601 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:54,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 511 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 21:47:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-08 21:47:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 140. [2024-11-08 21:47:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 96 states have internal predecessors, (118), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 21:47:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2024-11-08 21:47:54,499 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 145 [2024-11-08 21:47:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:54,501 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2024-11-08 21:47:54,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 4 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-08 21:47:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2024-11-08 21:47:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 21:47:54,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:54,510 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:47:54,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 21:47:54,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-08 21:47:54,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:54,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1657699660, now seen corresponding path program 1 times [2024-11-08 21:47:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:54,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686671002] [2024-11-08 21:47:54,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:54,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:47:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:47:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:47:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:47:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:47:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:47:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:47:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:47:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:47:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:47:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:47:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:47:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:47:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:47:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 81 proven. 81 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-08 21:47:55,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:55,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686671002] [2024-11-08 21:47:55,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686671002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:47:55,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784073436] [2024-11-08 21:47:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:55,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:47:55,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:55,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:47:55,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 21:47:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:55,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 21:47:55,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:47:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 563 proven. 111 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-08 21:47:56,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:47:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 81 proven. 90 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2024-11-08 21:47:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784073436] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:47:57,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:47:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 13] total 31 [2024-11-08 21:47:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263045509] [2024-11-08 21:47:57,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:47:57,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 21:47:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:57,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 21:47:57,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2024-11-08 21:47:57,457 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 10 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-08 21:48:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:00,145 INFO L93 Difference]: Finished difference Result 425 states and 543 transitions. [2024-11-08 21:48:00,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-08 21:48:00,146 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 10 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) Word has length 145 [2024-11-08 21:48:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:00,149 INFO L225 Difference]: With dead ends: 425 [2024-11-08 21:48:00,149 INFO L226 Difference]: Without dead ends: 322 [2024-11-08 21:48:00,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1745, Invalid=5911, Unknown=0, NotChecked=0, Total=7656 [2024-11-08 21:48:00,154 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1250 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:00,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 512 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 21:48:00,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-08 21:48:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 184. [2024-11-08 21:48:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 130 states have (on average 1.2) internal successors, (156), 131 states have internal predecessors, (156), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 21:48:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 230 transitions. [2024-11-08 21:48:00,187 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 230 transitions. Word has length 145 [2024-11-08 21:48:00,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:00,189 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 230 transitions. [2024-11-08 21:48:00,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 10 states have call successors, (49), 5 states have call predecessors, (49), 11 states have return successors, (50), 10 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-08 21:48:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 230 transitions. [2024-11-08 21:48:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 21:48:00,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:00,194 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:48:00,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 21:48:00,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-08 21:48:00,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:00,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:00,396 INFO L85 PathProgramCache]: Analyzing trace with hash -309311703, now seen corresponding path program 1 times [2024-11-08 21:48:00,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:00,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850957525] [2024-11-08 21:48:00,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:00,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:48:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:48:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:48:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:48:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:48:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:48:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:48:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:48:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:48:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:48:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:48:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:48:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 81 proven. 81 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-08 21:48:01,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:01,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850957525] [2024-11-08 21:48:01,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850957525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:48:01,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623733610] [2024-11-08 21:48:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:01,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:48:01,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:48:01,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:48:01,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 21:48:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:01,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 21:48:01,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-08 21:48:01,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:48:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 42 proven. 75 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-11-08 21:48:02,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623733610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:48:02,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:48:02,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2024-11-08 21:48:02,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810009793] [2024-11-08 21:48:02,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:48:02,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 21:48:02,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:02,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 21:48:02,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-08 21:48:02,039 INFO L87 Difference]: Start difference. First operand 184 states and 230 transitions. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 8 states have call successors, (49), 3 states have call predecessors, (49), 7 states have return successors, (50), 8 states have call predecessors, (50), 8 states have call successors, (50) [2024-11-08 21:48:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:03,049 INFO L93 Difference]: Finished difference Result 335 states and 416 transitions. [2024-11-08 21:48:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 21:48:03,051 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 8 states have call successors, (49), 3 states have call predecessors, (49), 7 states have return successors, (50), 8 states have call predecessors, (50), 8 states have call successors, (50) Word has length 146 [2024-11-08 21:48:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:03,053 INFO L225 Difference]: With dead ends: 335 [2024-11-08 21:48:03,053 INFO L226 Difference]: Without dead ends: 208 [2024-11-08 21:48:03,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=543, Invalid=1619, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 21:48:03,056 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 592 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:03,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 340 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:48:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-08 21:48:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2024-11-08 21:48:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 135 states have (on average 1.1851851851851851) internal successors, (160), 136 states have internal predecessors, (160), 37 states have call successors, (37), 18 states have call predecessors, (37), 18 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 21:48:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 234 transitions. [2024-11-08 21:48:03,086 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 234 transitions. Word has length 146 [2024-11-08 21:48:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:03,086 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 234 transitions. [2024-11-08 21:48:03,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 8 states have call successors, (49), 3 states have call predecessors, (49), 7 states have return successors, (50), 8 states have call predecessors, (50), 8 states have call successors, (50) [2024-11-08 21:48:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 234 transitions. [2024-11-08 21:48:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 21:48:03,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:03,089 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:48:03,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 21:48:03,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:48:03,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:03,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:03,294 INFO L85 PathProgramCache]: Analyzing trace with hash -896117717, now seen corresponding path program 1 times [2024-11-08 21:48:03,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:03,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193370282] [2024-11-08 21:48:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:03,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:03,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:03,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:03,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:48:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:48:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:48:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:48:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 21:48:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:48:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:48:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:48:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:48:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:48:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:48:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:48:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-08 21:48:04,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:04,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193370282] [2024-11-08 21:48:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193370282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:48:04,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259507738] [2024-11-08 21:48:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:04,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:48:04,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:48:04,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:48:04,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 21:48:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:04,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 21:48:04,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 555 proven. 132 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-08 21:48:05,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:48:06,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259507738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:48:06,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:48:06,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 22 [2024-11-08 21:48:06,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502592437] [2024-11-08 21:48:06,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:48:06,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 21:48:06,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:06,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 21:48:06,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2024-11-08 21:48:06,451 INFO L87 Difference]: Start difference. First operand 191 states and 234 transitions. Second operand has 22 states, 22 states have (on average 3.909090909090909) internal successors, (86), 21 states have internal predecessors, (86), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2024-11-08 21:48:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:07,377 INFO L93 Difference]: Finished difference Result 337 states and 415 transitions. [2024-11-08 21:48:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-08 21:48:07,378 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.909090909090909) internal successors, (86), 21 states have internal predecessors, (86), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) Word has length 146 [2024-11-08 21:48:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:07,380 INFO L225 Difference]: With dead ends: 337 [2024-11-08 21:48:07,380 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 21:48:07,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=744, Invalid=2448, Unknown=0, NotChecked=0, Total=3192 [2024-11-08 21:48:07,383 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 319 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:07,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 392 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:48:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 21:48:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 191. [2024-11-08 21:48:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 135 states have (on average 1.1703703703703703) internal successors, (158), 136 states have internal predecessors, (158), 37 states have call successors, (37), 18 states have call predecessors, (37), 18 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 21:48:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2024-11-08 21:48:07,421 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 146 [2024-11-08 21:48:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:07,422 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2024-11-08 21:48:07,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.909090909090909) internal successors, (86), 21 states have internal predecessors, (86), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2024-11-08 21:48:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2024-11-08 21:48:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 21:48:07,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:07,427 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:48:07,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 21:48:07,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:48:07,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:07,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash -55985574, now seen corresponding path program 1 times [2024-11-08 21:48:07,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:07,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73001409] [2024-11-08 21:48:07,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:48:07,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040536571] [2024-11-08 21:48:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:07,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:48:07,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:48:07,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:48:07,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 21:48:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:48:07,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:48:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:48:08,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:48:08,023 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:48:08,025 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:48:08,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 21:48:08,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:48:08,229 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 21:48:08,341 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:48:08,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:48:08 BoogieIcfgContainer [2024-11-08 21:48:08,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:48:08,344 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:48:08,344 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:48:08,344 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:48:08,344 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:50" (3/4) ... [2024-11-08 21:48:08,346 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:48:08,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:48:08,347 INFO L158 Benchmark]: Toolchain (without parser) took 19080.61ms. Allocated memory was 178.3MB in the beginning and 331.4MB in the end (delta: 153.1MB). Free memory was 120.6MB in the beginning and 124.2MB in the end (delta: -3.6MB). Peak memory consumption was 150.8MB. Max. memory is 16.1GB. [2024-11-08 21:48:08,348 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 178.3MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:48:08,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.33ms. Allocated memory is still 178.3MB. Free memory was 120.6MB in the beginning and 103.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 21:48:08,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.77ms. Allocated memory is still 178.3MB. Free memory was 103.4MB in the beginning and 96.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:48:08,348 INFO L158 Benchmark]: Boogie Preprocessor took 93.26ms. Allocated memory is still 178.3MB. Free memory was 96.1MB in the beginning and 87.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 21:48:08,348 INFO L158 Benchmark]: RCFGBuilder took 821.00ms. Allocated memory is still 178.3MB. Free memory was 87.4MB in the beginning and 128.8MB in the end (delta: -41.4MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-08 21:48:08,349 INFO L158 Benchmark]: TraceAbstraction took 17723.85ms. Allocated memory was 178.3MB in the beginning and 331.4MB in the end (delta: 153.1MB). Free memory was 128.8MB in the beginning and 124.2MB in the end (delta: 4.5MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. [2024-11-08 21:48:08,349 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 331.4MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:48:08,350 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.18ms. Allocated memory is still 178.3MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.33ms. Allocated memory is still 178.3MB. Free memory was 120.6MB in the beginning and 103.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.77ms. Allocated memory is still 178.3MB. Free memory was 103.4MB in the beginning and 96.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.26ms. Allocated memory is still 178.3MB. Free memory was 96.1MB in the beginning and 87.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 821.00ms. Allocated memory is still 178.3MB. Free memory was 87.4MB in the beginning and 128.8MB in the end (delta: -41.4MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17723.85ms. Allocated memory was 178.3MB in the beginning and 331.4MB in the end (delta: 153.1MB). Free memory was 128.8MB in the beginning and 124.2MB in the end (delta: 4.5MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 331.4MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryArithmeticFLOAToperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -25; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1230640054; [L25] signed long int var_1_6 = 1508873667; [L26] unsigned char var_1_7 = 64; [L27] unsigned char var_1_8 = 200; [L28] unsigned char var_1_9 = 16; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 8; [L31] float var_1_12 = 15.4; [L32] float var_1_16 = 10000000000000.375; [L33] float var_1_17 = 16.4; [L34] float var_1_18 = 8.5; [L35] float var_1_19 = 64.75; [L36] unsigned char var_1_20 = 16; [L37] signed char var_1_22 = 0; [L38] unsigned char var_1_23 = 16; [L39] unsigned char var_1_24 = 128; [L40] signed short int var_1_30 = -256; [L41] signed short int var_1_31 = 2; [L42] signed short int var_1_34 = -2; [L43] signed short int var_1_36 = -50; [L44] unsigned char var_1_37 = 4; [L45] unsigned char var_1_38 = 64; [L46] float var_1_40 = 0.8; [L47] signed short int var_1_44 = 1; [L48] signed long int var_1_45 = 4; [L49] float var_1_46 = 1000000000000.375; VAL [isInitial=0, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L160] isInitial = 1 [L161] FCALL initially() [L162] COND TRUE 1 [L163] FCALL updateLastVariables() [L164] CALL updateVariables() [L120] var_1_2 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L121] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L122] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L122] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L123] var_1_3 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L124] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L125] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L125] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L126] var_1_6 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_6 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L127] RET assume_abort_if_not(var_1_6 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L128] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L128] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L130] RET assume_abort_if_not(var_1_8 >= 190) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L131] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L131] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=16] [L132] var_1_9 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578] [L133] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578] [L134] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L134] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L135] var_1_10 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L136] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L137] CALL assume_abort_if_not(var_1_10 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L137] RET assume_abort_if_not(var_1_10 <= 32) VAL [isInitial=1, var_1_10=256, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L138] var_1_11 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L139] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L140] CALL assume_abort_if_not(var_1_11 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L140] RET assume_abort_if_not(var_1_11 <= 31) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L141] var_1_17 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L142] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L143] var_1_18 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L144] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L145] var_1_20 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L146] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L147] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L147] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L148] CALL assume_abort_if_not(var_1_20 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L148] RET assume_abort_if_not(var_1_20 != 127) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L149] var_1_38 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_38 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L150] RET assume_abort_if_not(var_1_38 >= 63) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L151] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L151] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=-578, var_1_9=-256] [L164] RET updateVariables() [L165] CALL step() [L53] var_1_7 = ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L54] COND FALSE !(1 >= var_1_3) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L59] COND TRUE \read(var_1_2) [L60] var_1_45 = (((((var_1_10 + var_1_38)) < (var_1_10)) ? ((var_1_10 + var_1_38)) : (var_1_10))) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L62] var_1_16 = (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L63] COND FALSE !((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) [L70] var_1_23 = var_1_20 VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L72] COND FALSE !(((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) < var_1_17) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L77] COND TRUE \read(var_1_2) [L78] var_1_1 = ((var_1_3 - var_1_7) - var_1_7) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L82] var_1_30 = var_1_8 [L83] var_1_46 = var_1_17 [L84] signed long int stepLocal_1 = var_1_9 % (var_1_8 - var_1_20); VAL [isInitial=1, stepLocal_1=0, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L85] EXPR var_1_7 ^ var_1_10 VAL [isInitial=1, stepLocal_1=0, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L85] signed long int stepLocal_0 = var_1_7 ^ var_1_10; [L86] COND FALSE !(stepLocal_1 > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L91] EXPR var_1_9 & var_1_9 VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L91] COND FALSE !(var_1_8 <= (var_1_9 & var_1_9)) [L94] COND TRUE (var_1_11 % var_1_20) < var_1_1 [L95] var_1_22 = ((((10) > (var_1_10)) ? (10) : (var_1_10))) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L97] COND TRUE \read(var_1_2) [L98] var_1_40 = ((((var_1_17) > ((var_1_18 + var_1_17))) ? (var_1_17) : ((var_1_18 + var_1_17)))) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=77/5, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L100] COND TRUE ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f)) [L101] var_1_12 = 31.5f VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=128, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L103] COND TRUE (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) >= (var_1_20 % var_1_20)) || var_1_2 [L104] var_1_24 = ((((var_1_8 - 8) < 0 ) ? -(var_1_8 - 8) : (var_1_8 - 8))) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L108] COND TRUE var_1_3 >= ((((32) > (var_1_8)) ? (32) : (var_1_8))) [L109] var_1_37 = (var_1_8 - (var_1_38 - var_1_9)) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L113] COND FALSE !(var_1_17 != var_1_19) VAL [isInitial=1, stepLocal_0=90, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L165] RET step() [L166] CALL, EXPR property() [L156] EXPR ((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L156-L157] return ((((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1)) && (((var_1_11 % var_1_20) < var_1_1) ? (var_1_22 == ((signed char) ((((10) > (var_1_10)) ? (10) : (var_1_10))))) : 1)) && (((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) ? ((var_1_10 > var_1_7) ? (var_1_23 == ((unsigned char) ((((var_1_20) < ((var_1_8 - var_1_9))) ? (var_1_20) : ((var_1_8 - var_1_9)))))) : (var_1_23 == ((unsigned char) (((((var_1_20) > (64)) ? (var_1_20) : (64))) + var_1_11)))) : (var_1_23 == ((unsigned char) var_1_20))) ; [L166] RET, EXPR property() [L166] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=256, var_1_11=-256, var_1_12=63/2, var_1_17=2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_24=182, var_1_2=1, var_1_30=190, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=127, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=0, var_1_46=2, var_1_6=1073741822, var_1_7=90, var_1_8=-578, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2765 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2762 mSDsluCounter, 1755 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1399 mSDsCounter, 760 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2648 IncrementalHoareTripleChecker+Invalid, 3408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 760 mSolverCounterUnsat, 356 mSDtfsCounter, 2648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1349 GetRequests, 1118 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4031 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=3, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 256 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1456 NumberOfCodeBlocks, 1456 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1445 ConstructedInterpolants, 0 QuantifiedInterpolants, 8951 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1392 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 10 InterpolantComputations, 0 PerfectInterpolantSequences, 7521/8400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:48:08,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:48:10,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:48:10,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:48:10,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:48:10,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:48:10,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:48:10,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:48:10,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:48:10,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:48:10,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:48:10,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:48:10,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:48:10,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:48:10,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:48:10,671 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:48:10,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:48:10,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:48:10,672 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:48:10,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:48:10,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:48:10,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:48:10,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:48:10,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:48:10,678 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:48:10,678 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:48:10,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:48:10,678 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:48:10,678 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:48:10,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:48:10,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:48:10,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:48:10,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:48:10,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:48:10,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:48:10,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:48:10,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:48:10,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:48:10,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:48:10,682 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:48:10,682 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:48:10,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:48:10,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:48:10,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:48:10,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:48:10,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 654542981f55ac0dfa4ff9a5a73c4558ad4f81f278b418004930bd889a962b4b [2024-11-08 21:48:11,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:48:11,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:48:11,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:48:11,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:48:11,031 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:48:11,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-08 21:48:12,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:48:12,766 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:48:12,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-08 21:48:12,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a8dfed3/ea7db30ee48d44b6bce14fc4ae3f5009/FLAG0949fe743 [2024-11-08 21:48:13,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a8dfed3/ea7db30ee48d44b6bce14fc4ae3f5009 [2024-11-08 21:48:13,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:48:13,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:48:13,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:48:13,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:48:13,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:48:13,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329a02fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13, skipping insertion in model container [2024-11-08 21:48:13,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:48:13,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i[919,932] [2024-11-08 21:48:13,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:48:13,462 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:48:13,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i[919,932] [2024-11-08 21:48:13,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:48:13,550 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:48:13,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13 WrapperNode [2024-11-08 21:48:13,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:48:13,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:48:13,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:48:13,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:48:13,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,610 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-08 21:48:13,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:48:13,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:48:13,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:48:13,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:48:13,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,660 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:48:13,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:48:13,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:48:13,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:48:13,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:48:13,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (1/1) ... [2024-11-08 21:48:13,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:48:13,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:48:13,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:48:13,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:48:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:48:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:48:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:48:13,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:48:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:48:13,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:48:13,863 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:48:13,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:48:16,019 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 21:48:16,020 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:48:16,032 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:48:16,032 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:48:16,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:48:16 BoogieIcfgContainer [2024-11-08 21:48:16,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:48:16,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:48:16,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:48:16,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:48:16,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:48:13" (1/3) ... [2024-11-08 21:48:16,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2afc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:48:16, skipping insertion in model container [2024-11-08 21:48:16,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:13" (2/3) ... [2024-11-08 21:48:16,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2afc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:48:16, skipping insertion in model container [2024-11-08 21:48:16,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:48:16" (3/3) ... [2024-11-08 21:48:16,040 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-83.i [2024-11-08 21:48:16,052 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:48:16,053 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:48:16,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:48:16,128 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;@69b3ac97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:48:16,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:48:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 21:48:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 21:48:16,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:16,142 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:48:16,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:16,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:16,146 INFO L85 PathProgramCache]: Analyzing trace with hash -842358286, now seen corresponding path program 1 times [2024-11-08 21:48:16,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:48:16,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839094841] [2024-11-08 21:48:16,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:16,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:48:16,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:48:16,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:48:16,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 21:48:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:16,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:48:16,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-08 21:48:16,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:48:16,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:48:16,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839094841] [2024-11-08 21:48:16,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839094841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:16,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:16,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:48:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436662786] [2024-11-08 21:48:16,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:16,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:48:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:48:16,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:48:16,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:48:16,738 INFO L87 Difference]: Start difference. First operand has 71 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 21:48:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:16,772 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2024-11-08 21:48:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:48:16,774 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2024-11-08 21:48:16,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:16,781 INFO L225 Difference]: With dead ends: 134 [2024-11-08 21:48:16,781 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 21:48:16,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:48:16,787 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:16,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:48:16,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 21:48:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-08 21:48:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 21:48:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 101 transitions. [2024-11-08 21:48:16,826 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 101 transitions. Word has length 140 [2024-11-08 21:48:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:16,827 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 101 transitions. [2024-11-08 21:48:16,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 21:48:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 101 transitions. [2024-11-08 21:48:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 21:48:16,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:16,830 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:48:16,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 21:48:17,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:48:17,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:17,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:17,033 INFO L85 PathProgramCache]: Analyzing trace with hash 169221484, now seen corresponding path program 1 times [2024-11-08 21:48:17,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:48:17,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484990370] [2024-11-08 21:48:17,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:17,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:48:17,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:48:17,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:48:17,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 21:48:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:17,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 21:48:17,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-08 21:48:18,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:48:18,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:48:18,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484990370] [2024-11-08 21:48:18,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484990370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:48:18,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2035716321] [2024-11-08 21:48:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:18,906 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:48:18,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:48:18,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 21:48:18,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-08 21:48:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:19,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:48:19,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 21:48:19,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:48:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2035716321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:19,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:48:19,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-08 21:48:19,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311963821] [2024-11-08 21:48:19,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:19,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:48:19,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:48:19,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:48:19,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:48:19,379 INFO L87 Difference]: Start difference. First operand 66 states and 101 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 21:48:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:20,198 INFO L93 Difference]: Finished difference Result 153 states and 235 transitions. [2024-11-08 21:48:20,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:48:20,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2024-11-08 21:48:20,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:20,223 INFO L225 Difference]: With dead ends: 153 [2024-11-08 21:48:20,223 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 21:48:20,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:48:20,226 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 30 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:20,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 184 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 21:48:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 21:48:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2024-11-08 21:48:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 21:48:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 118 transitions. [2024-11-08 21:48:20,244 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 118 transitions. Word has length 140 [2024-11-08 21:48:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:20,246 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 118 transitions. [2024-11-08 21:48:20,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 21:48:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2024-11-08 21:48:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 21:48:20,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:20,250 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:48:20,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-08 21:48:20,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 21:48:20,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:48:20,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:20,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:20,652 INFO L85 PathProgramCache]: Analyzing trace with hash 849279854, now seen corresponding path program 1 times [2024-11-08 21:48:20,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:48:20,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070311685] [2024-11-08 21:48:20,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:20,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:48:20,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:48:20,658 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:48:20,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 21:48:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:21,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 21:48:21,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-08 21:48:22,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:48:22,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:48:22,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070311685] [2024-11-08 21:48:22,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070311685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:48:22,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1572947928] [2024-11-08 21:48:22,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:22,470 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:48:22,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:48:22,472 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 21:48:22,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 21:48:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 21:48:23,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 72 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-08 21:48:24,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:48:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1572947928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:48:24,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:48:24,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-08 21:48:24,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065657060] [2024-11-08 21:48:24,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:48:24,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 21:48:24,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:48:24,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 21:48:24,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:48:24,599 INFO L87 Difference]: Start difference. First operand 77 states and 118 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 21:48:26,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:48:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:26,474 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2024-11-08 21:48:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 21:48:26,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 140 [2024-11-08 21:48:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:26,501 INFO L225 Difference]: With dead ends: 163 [2024-11-08 21:48:26,501 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 21:48:26,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-08 21:48:26,503 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 46 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:26,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 156 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 21:48:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 21:48:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-08 21:48:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 21:48:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-11-08 21:48:26,518 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 140 [2024-11-08 21:48:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:26,519 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-11-08 21:48:26,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 21:48:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-11-08 21:48:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 21:48:26,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:26,522 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:48:26,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-08 21:48:26,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-08 21:48:26,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 21:48:26,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:26,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:26,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1550344432, now seen corresponding path program 1 times [2024-11-08 21:48:26,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:48:26,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454968960] [2024-11-08 21:48:26,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:26,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:48:26,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:48:26,926 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:48:26,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 21:48:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 21:48:27,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 362 proven. 93 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-08 21:48:28,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:48:29,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:48:29,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454968960] [2024-11-08 21:48:29,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454968960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:48:29,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [125888289] [2024-11-08 21:48:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:29,873 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:48:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:48:29,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 21:48:29,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-08 21:48:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 21:48:30,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 362 proven. 93 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-08 21:48:31,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:48:32,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [125888289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:48:32,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:48:32,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-08 21:48:32,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88692459] [2024-11-08 21:48:32,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:48:32,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 21:48:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:48:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 21:48:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-08 21:48:32,824 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 21:48:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:34,365 INFO L93 Difference]: Finished difference Result 176 states and 244 transitions. [2024-11-08 21:48:34,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 21:48:34,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 140 [2024-11-08 21:48:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:34,392 INFO L225 Difference]: With dead ends: 176 [2024-11-08 21:48:34,392 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 21:48:34,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-11-08 21:48:34,394 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 49 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:34,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 167 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 21:48:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 21:48:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-08 21:48:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 21:48:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2024-11-08 21:48:34,413 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 140 [2024-11-08 21:48:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:34,414 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2024-11-08 21:48:34,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 21:48:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2024-11-08 21:48:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 21:48:34,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:34,419 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:48:34,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 21:48:34,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-08 21:48:34,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 21:48:34,821 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:34,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:34,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1493086130, now seen corresponding path program 1 times [2024-11-08 21:48:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:48:34,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823390514] [2024-11-08 21:48:34,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:34,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:48:34,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:48:34,826 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:48:34,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 21:48:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:35,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 21:48:35,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 350 proven. 15 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2024-11-08 21:48:49,594 INFO L311 TraceCheckSpWp]: Computing backward predicates...