./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:46:18,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:46:18,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:46:18,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:46:18,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:46:18,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:46:18,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:46:18,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:46:18,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:46:18,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:46:18,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:46:18,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:46:18,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:46:18,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:46:18,689 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:46:18,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:46:18,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:46:18,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:46:18,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:46:18,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:46:18,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:46:18,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:46:18,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:46:18,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:46:18,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:46:18,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:46:18,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:46:18,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:46:18,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:46:18,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:46:18,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:46:18,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:46:18,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:46:18,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:46:18,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:46:18,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:46:18,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:46:18,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:46:18,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:46:18,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:46:18,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:46:18,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:46:18,698 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc [2024-10-11 07:46:19,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:46:19,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:46:19,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:46:19,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:46:19,037 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:46:19,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i [2024-10-11 07:46:20,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:46:20,509 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:46:20,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i [2024-10-11 07:46:20,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ea1315e92/fc739bcefd30465e93531279c5f65603/FLAGaada756b3 [2024-10-11 07:46:20,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ea1315e92/fc739bcefd30465e93531279c5f65603 [2024-10-11 07:46:20,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:46:20,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:46:20,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:46:20,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:46:20,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:46:20,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dcc43cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20, skipping insertion in model container [2024-10-11 07:46:20,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:46:20,776 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i[913,926] [2024-10-11 07:46:20,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:46:20,836 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:46:20,848 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i[913,926] [2024-10-11 07:46:20,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:46:20,878 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:46:20,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20 WrapperNode [2024-10-11 07:46:20,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:46:20,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:46:20,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:46:20,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:46:20,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,928 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-10-11 07:46:20,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:46:20,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:46:20,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:46:20,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:46:20,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,967 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:46:20,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:20,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:46:20,995 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:46:20,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:46:20,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:46:20,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (1/1) ... [2024-10-11 07:46:21,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:46:21,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:46:21,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:46:21,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:46:21,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:46:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:46:21,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:46:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:46:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:46:21,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:46:21,130 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:46:21,132 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:46:21,390 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 07:46:21,390 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:46:21,415 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:46:21,416 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:46:21,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:46:21 BoogieIcfgContainer [2024-10-11 07:46:21,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:46:21,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:46:21,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:46:21,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:46:21,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:46:20" (1/3) ... [2024-10-11 07:46:21,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f4faa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:46:21, skipping insertion in model container [2024-10-11 07:46:21,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:20" (2/3) ... [2024-10-11 07:46:21,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f4faa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:46:21, skipping insertion in model container [2024-10-11 07:46:21,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:46:21" (3/3) ... [2024-10-11 07:46:21,423 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-65.i [2024-10-11 07:46:21,436 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:46:21,437 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:46:21,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:46:21,490 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;@1b24523e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:46:21,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:46:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 07:46:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 07:46:21,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:21,510 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:21,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:21,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash -964313791, now seen corresponding path program 1 times [2024-10-11 07:46:21,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:46:21,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550822843] [2024-10-11 07:46:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:21,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:46:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:46:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:46:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:46:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:46:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:46:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:46:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:46:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:46:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:46:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:46:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:46:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:46:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:46:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:46:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:46:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:46:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:46:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:46:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 07:46:21,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:46:21,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550822843] [2024-10-11 07:46:21,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550822843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:46:21,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:46:21,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:46:21,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923927225] [2024-10-11 07:46:21,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:46:21,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:46:21,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:46:21,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:46:21,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:46:21,852 INFO L87 Difference]: Start difference. First operand has 71 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 07:46:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:46:21,890 INFO L93 Difference]: Finished difference Result 137 states and 236 transitions. [2024-10-11 07:46:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:46:21,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2024-10-11 07:46:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:46:21,899 INFO L225 Difference]: With dead ends: 137 [2024-10-11 07:46:21,900 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 07:46:21,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:46:21,907 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:46:21,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:46:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 07:46:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 07:46:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 07:46:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-10-11 07:46:21,944 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 118 [2024-10-11 07:46:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:46:21,944 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-10-11 07:46:21,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 07:46:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-10-11 07:46:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 07:46:21,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:21,948 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:21,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:46:21,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:21,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:21,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1651243461, now seen corresponding path program 1 times [2024-10-11 07:46:21,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:46:21,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640763460] [2024-10-11 07:46:21,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:21,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:46:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:46:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:46:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:46:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:46:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:46:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:46:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:46:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:46:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:46:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:46:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:46:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:46:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:46:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:46:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:46:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:46:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:46:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:46:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 07:46:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:46:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640763460] [2024-10-11 07:46:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640763460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:46:22,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:46:22,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:46:22,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332254836] [2024-10-11 07:46:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:46:22,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:46:22,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:46:22,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:46:22,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:46:22,255 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:46:22,324 INFO L93 Difference]: Finished difference Result 199 states and 301 transitions. [2024-10-11 07:46:22,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:46:22,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-10-11 07:46:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:46:22,329 INFO L225 Difference]: With dead ends: 199 [2024-10-11 07:46:22,329 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 07:46:22,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:46:22,331 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 87 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:46:22,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 251 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:46:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 07:46:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 84. [2024-10-11 07:46:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 07:46:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2024-10-11 07:46:22,344 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 118 [2024-10-11 07:46:22,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:46:22,345 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2024-10-11 07:46:22,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2024-10-11 07:46:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 07:46:22,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:22,347 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:22,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:46:22,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:22,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash 108447395, now seen corresponding path program 1 times [2024-10-11 07:46:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:46:22,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630623404] [2024-10-11 07:46:22,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:46:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:46:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:46:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:46:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:46:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:46:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:46:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:46:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:46:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:46:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:46:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:46:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:46:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:46:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:46:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:46:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:46:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:46:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:46:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 07:46:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:46:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630623404] [2024-10-11 07:46:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630623404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:46:22,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:46:22,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:46:22,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915384929] [2024-10-11 07:46:22,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:46:22,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:46:22,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:46:22,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:46:22,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:46:22,500 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:46:22,524 INFO L93 Difference]: Finished difference Result 148 states and 217 transitions. [2024-10-11 07:46:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:46:22,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-10-11 07:46:22,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:46:22,526 INFO L225 Difference]: With dead ends: 148 [2024-10-11 07:46:22,526 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 07:46:22,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:46:22,528 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:46:22,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:46:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 07:46:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 07:46:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 07:46:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2024-10-11 07:46:22,536 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 119 [2024-10-11 07:46:22,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:46:22,540 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2024-10-11 07:46:22,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2024-10-11 07:46:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 07:46:22,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:22,541 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:22,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:46:22,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:22,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash -253023008, now seen corresponding path program 1 times [2024-10-11 07:46:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:46:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619451662] [2024-10-11 07:46:22,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:22,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:46:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:46:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:46:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:46:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:46:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:46:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:46:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:46:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:46:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:46:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:46:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:46:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:46:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:46:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:46:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:46:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:46:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:46:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:46:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 07:46:23,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:46:23,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619451662] [2024-10-11 07:46:23,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619451662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:46:23,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:46:23,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:46:23,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597511204] [2024-10-11 07:46:23,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:46:23,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:46:23,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:46:23,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:46:23,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:46:23,207 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:46:23,487 INFO L93 Difference]: Finished difference Result 214 states and 306 transitions. [2024-10-11 07:46:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:46:23,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-10-11 07:46:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:46:23,490 INFO L225 Difference]: With dead ends: 214 [2024-10-11 07:46:23,490 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 07:46:23,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:46:23,495 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 191 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:46:23,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 465 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:46:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 07:46:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 67. [2024-10-11 07:46:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 07:46:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2024-10-11 07:46:23,515 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 120 [2024-10-11 07:46:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:46:23,516 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2024-10-11 07:46:23,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2024-10-11 07:46:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 07:46:23,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:23,517 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:23,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:46:23,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:23,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash -302494829, now seen corresponding path program 1 times [2024-10-11 07:46:23,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:46:23,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146819204] [2024-10-11 07:46:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:23,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:46:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:46:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:46:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:46:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:46:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:46:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:46:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:46:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:46:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:46:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:46:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:46:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:46:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:46:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:46:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:46:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:46:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:46:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:46:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 07:46:24,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:46:24,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146819204] [2024-10-11 07:46:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146819204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:46:24,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:46:24,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:46:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354682422] [2024-10-11 07:46:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:46:24,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:46:24,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:46:24,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:46:24,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:46:24,223 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 07:46:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:46:24,490 INFO L93 Difference]: Finished difference Result 161 states and 225 transitions. [2024-10-11 07:46:24,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:46:24,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 121 [2024-10-11 07:46:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:46:24,493 INFO L225 Difference]: With dead ends: 161 [2024-10-11 07:46:24,494 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 07:46:24,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:46:24,495 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 188 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:46:24,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 159 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:46:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 07:46:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-11 07:46:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 61 states have internal predecessors, (70), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:46:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2024-10-11 07:46:24,516 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 121 [2024-10-11 07:46:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:46:24,516 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2024-10-11 07:46:24,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 07:46:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2024-10-11 07:46:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 07:46:24,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:24,518 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:24,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:46:24,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:24,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1111841455, now seen corresponding path program 1 times [2024-10-11 07:46:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:46:24,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133391953] [2024-10-11 07:46:24,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:46:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:24,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:46:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:46:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:46:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:46:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:46:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:46:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:46:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:46:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:46:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:46:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:46:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:46:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:46:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:46:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:46:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:46:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:46:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:46:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 07:46:25,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:46:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133391953] [2024-10-11 07:46:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133391953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:46:25,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:46:25,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:46:25,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83890963] [2024-10-11 07:46:25,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:46:25,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:46:25,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:46:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:46:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:46:25,043 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:46:25,369 INFO L93 Difference]: Finished difference Result 244 states and 326 transitions. [2024-10-11 07:46:25,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:46:25,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-10-11 07:46:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:46:25,371 INFO L225 Difference]: With dead ends: 244 [2024-10-11 07:46:25,372 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 07:46:25,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:46:25,373 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 180 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:46:25,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 488 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:46:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 07:46:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 109. [2024-10-11 07:46:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 68 states have internal predecessors, (76), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 07:46:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 148 transitions. [2024-10-11 07:46:25,395 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 148 transitions. Word has length 121 [2024-10-11 07:46:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:46:25,396 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 148 transitions. [2024-10-11 07:46:25,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 148 transitions. [2024-10-11 07:46:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 07:46:25,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:25,397 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:25,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:46:25,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:25,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:25,398 INFO L85 PathProgramCache]: Analyzing trace with hash 963368810, now seen corresponding path program 1 times [2024-10-11 07:46:25,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:46:25,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211149874] [2024-10-11 07:46:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:46:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:46:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:46:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:46:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:46:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:46:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:46:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:46:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:46:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:46:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:46:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:46:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:46:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:46:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:46:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:46:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:46:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:46:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:46:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 07:46:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:46:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211149874] [2024-10-11 07:46:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211149874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:46:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433192596] [2024-10-11 07:46:25,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:25,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:46:25,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:46:25,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:46:25,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:46:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:25,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 07:46:25,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:46:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-10-11 07:46:25,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:46:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 07:46:26,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433192596] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:46:26,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:46:26,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 07:46:26,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881575127] [2024-10-11 07:46:26,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:46:26,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:46:26,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:46:26,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:46:26,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:46:26,155 INFO L87 Difference]: Start difference. First operand 109 states and 148 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 07:46:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:46:26,340 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2024-10-11 07:46:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:46:26,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 124 [2024-10-11 07:46:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:46:26,343 INFO L225 Difference]: With dead ends: 197 [2024-10-11 07:46:26,343 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 07:46:26,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-11 07:46:26,344 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 84 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:46:26,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 178 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:46:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 07:46:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2024-10-11 07:46:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 74 states have internal predecessors, (81), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 07:46:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 153 transitions. [2024-10-11 07:46:26,378 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 153 transitions. Word has length 124 [2024-10-11 07:46:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:46:26,379 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 153 transitions. [2024-10-11 07:46:26,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 07:46:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 153 transitions. [2024-10-11 07:46:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 07:46:26,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:26,380 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:26,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 07:46:26,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:46:26,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:26,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:26,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1476939941, now seen corresponding path program 1 times [2024-10-11 07:46:26,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:46:26,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63559189] [2024-10-11 07:46:26,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:26,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:46:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:46:26,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:46:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:46:26,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:46:26,701 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:46:26,702 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:46:26,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:46:26,706 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:26,777 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:46:26,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:46:26 BoogieIcfgContainer [2024-10-11 07:46:26,780 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:46:26,780 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:46:26,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:46:26,780 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:46:26,781 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:46:21" (3/4) ... [2024-10-11 07:46:26,782 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:46:26,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:46:26,783 INFO L158 Benchmark]: Toolchain (without parser) took 6242.75ms. Allocated memory was 127.9MB in the beginning and 390.1MB in the end (delta: 262.1MB). Free memory was 58.7MB in the beginning and 187.0MB in the end (delta: -128.3MB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. [2024-10-11 07:46:26,784 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory was 96.2MB in the beginning and 96.2MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:46:26,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.64ms. Allocated memory was 127.9MB in the beginning and 224.4MB in the end (delta: 96.5MB). Free memory was 58.5MB in the beginning and 186.0MB in the end (delta: -127.5MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-10-11 07:46:26,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.91ms. Allocated memory is still 224.4MB. Free memory was 186.0MB in the beginning and 182.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:46:26,784 INFO L158 Benchmark]: Boogie Preprocessor took 64.90ms. Allocated memory is still 224.4MB. Free memory was 182.9MB in the beginning and 178.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:46:26,784 INFO L158 Benchmark]: RCFGBuilder took 421.71ms. Allocated memory is still 224.4MB. Free memory was 178.7MB in the beginning and 154.6MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 07:46:26,785 INFO L158 Benchmark]: TraceAbstraction took 5361.77ms. Allocated memory was 224.4MB in the beginning and 390.1MB in the end (delta: 165.7MB). Free memory was 153.6MB in the beginning and 187.0MB in the end (delta: -33.4MB). Peak memory consumption was 133.3MB. Max. memory is 16.1GB. [2024-10-11 07:46:26,785 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 390.1MB. Free memory is still 187.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:46:26,786 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.14ms. Allocated memory is still 127.9MB. Free memory was 96.2MB in the beginning and 96.2MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.64ms. Allocated memory was 127.9MB in the beginning and 224.4MB in the end (delta: 96.5MB). Free memory was 58.5MB in the beginning and 186.0MB in the end (delta: -127.5MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.91ms. Allocated memory is still 224.4MB. Free memory was 186.0MB in the beginning and 182.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.90ms. Allocated memory is still 224.4MB. Free memory was 182.9MB in the beginning and 178.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 421.71ms. Allocated memory is still 224.4MB. Free memory was 178.7MB in the beginning and 154.6MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5361.77ms. Allocated memory was 224.4MB in the beginning and 390.1MB in the end (delta: 165.7MB). Free memory was 153.6MB in the beginning and 187.0MB in the end (delta: -33.4MB). Peak memory consumption was 133.3MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 390.1MB. Free memory is still 187.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed short int last_1_var_1_1 = 4; [L41] unsigned char last_1_var_1_14 = 1; [L42] signed char last_1_var_1_16 = 50; [L43] signed long int last_1_var_1_23 = -16; [L44] unsigned char last_1_var_1_24 = 1; [L45] double last_1_var_1_28 = 5.5; [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L119] last_1_var_1_1 = var_1_1 [L120] last_1_var_1_14 = var_1_14 [L121] last_1_var_1_16 = var_1_16 [L122] last_1_var_1_23 = var_1_23 [L123] last_1_var_1_24 = var_1_24 [L124] last_1_var_1_28 = var_1_28 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L89] var_1_11 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L90] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L91] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L91] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L92] var_1_12 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L93] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L94] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L94] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L95] var_1_13 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L96] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L97] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L97] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L98] var_1_15 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L99] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L100] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L100] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L101] var_1_19 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L102] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L103] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L103] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L104] var_1_21 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L105] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L106] var_1_22 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L107] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L108] var_1_25 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L109] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L110] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L110] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L111] var_1_26 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L112] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L113] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L113] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L114] var_1_27 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_28=11/2, var_1_8=64] [L115] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_28=11/2, var_1_8=64] [L116] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L116] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L135] RET updateVariables() [L136] CALL step() [L49] signed long int stepLocal_3 = last_1_var_1_23; [L50] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L51] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L62] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L64] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L64] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L65] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L69] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L70] var_1_28 = var_1_21 [L71] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_21=100000005, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L72] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L73] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L77] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L78] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L79] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L79] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L80] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L82] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L83] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L127] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L127] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L127] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L127-L128] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 753 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 730 mSDsluCounter, 1810 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 890 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 649 IncrementalHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 920 mSDtfsCounter, 649 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 570 GetRequests, 531 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 202 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1090 NumberOfCodeBlocks, 1090 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1080 ConstructedInterpolants, 0 QuantifiedInterpolants, 3924 SizeOfPredicates, 4 NumberOfNonLiveVariables, 305 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 5409/5508 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:46:26,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:46:29,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:46:29,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:46:29,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:46:29,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:46:29,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:46:29,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:46:29,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:46:29,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:46:29,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:46:29,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:46:29,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:46:29,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:46:29,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:46:29,238 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:46:29,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:46:29,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:46:29,239 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:46:29,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:46:29,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:46:29,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:46:29,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:46:29,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:46:29,241 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:46:29,242 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:46:29,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:46:29,242 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:46:29,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:46:29,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:46:29,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:46:29,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:46:29,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:46:29,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:46:29,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:46:29,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:46:29,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:46:29,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:46:29,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:46:29,256 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:46:29,257 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:46:29,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:46:29,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:46:29,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:46:29,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:46:29,258 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:46:29,258 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc224bde26358da9997f9941009f63e79d979df8df0c5e0ccdb6f1d2abc5adfc [2024-10-11 07:46:29,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:46:29,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:46:29,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:46:29,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:46:29,560 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:46:29,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i [2024-10-11 07:46:30,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:46:31,121 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:46:31,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i [2024-10-11 07:46:31,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/66834516a/e4f758ffe6b24b5f8e0df8121dea4922/FLAGd7a836bc1 [2024-10-11 07:46:31,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/66834516a/e4f758ffe6b24b5f8e0df8121dea4922 [2024-10-11 07:46:31,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:46:31,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:46:31,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:46:31,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:46:31,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:46:31,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e45021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31, skipping insertion in model container [2024-10-11 07:46:31,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:46:31,695 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i[913,926] [2024-10-11 07:46:31,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:46:31,782 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:46:31,795 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-65.i[913,926] [2024-10-11 07:46:31,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:46:31,827 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:46:31,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31 WrapperNode [2024-10-11 07:46:31,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:46:31,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:46:31,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:46:31,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:46:31,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,877 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-10-11 07:46:31,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:46:31,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:46:31,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:46:31,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:46:31,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,913 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:46:31,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:46:31,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:46:31,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:46:31,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:46:31,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (1/1) ... [2024-10-11 07:46:31,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:46:31,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:46:31,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:46:31,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:46:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:46:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:46:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:46:31,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:46:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:46:31,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:46:32,068 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:46:32,070 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:46:32,842 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 07:46:32,842 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:46:32,900 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:46:32,900 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:46:32,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:46:32 BoogieIcfgContainer [2024-10-11 07:46:32,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:46:32,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:46:32,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:46:32,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:46:32,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:46:31" (1/3) ... [2024-10-11 07:46:32,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aaccef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:46:32, skipping insertion in model container [2024-10-11 07:46:32,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:31" (2/3) ... [2024-10-11 07:46:32,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aaccef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:46:32, skipping insertion in model container [2024-10-11 07:46:32,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:46:32" (3/3) ... [2024-10-11 07:46:32,907 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-65.i [2024-10-11 07:46:32,920 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:46:32,920 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:46:32,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:46:32,978 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;@193f172e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:46:32,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:46:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 07:46:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 07:46:32,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:32,996 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:32,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:33,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash -332515944, now seen corresponding path program 1 times [2024-10-11 07:46:33,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:46:33,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266675305] [2024-10-11 07:46:33,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:33,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:46:33,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:46:33,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:46:33,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:46:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:33,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:46:33,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:46:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-10-11 07:46:33,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:46:33,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:46:33,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266675305] [2024-10-11 07:46:33,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266675305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:46:33,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:46:33,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:46:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787200675] [2024-10-11 07:46:33,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:46:33,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:46:33,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:46:33,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:46:33,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:46:33,326 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 07:46:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:46:33,881 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2024-10-11 07:46:33,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:46:33,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2024-10-11 07:46:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:46:33,912 INFO L225 Difference]: With dead ends: 99 [2024-10-11 07:46:33,912 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 07:46:33,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:46:33,920 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:46:33,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 07:46:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 07:46:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-11 07:46:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 07:46:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2024-10-11 07:46:33,997 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 112 [2024-10-11 07:46:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:46:33,997 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2024-10-11 07:46:33,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 07:46:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-10-11 07:46:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 07:46:34,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:34,010 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:34,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 07:46:34,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:46:34,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:34,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:34,214 INFO L85 PathProgramCache]: Analyzing trace with hash 244131100, now seen corresponding path program 1 times [2024-10-11 07:46:34,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:46:34,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970811828] [2024-10-11 07:46:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:34,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:46:34,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:46:34,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:46:34,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:46:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:34,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:46:34,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:46:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 07:46:34,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:46:34,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:46:34,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970811828] [2024-10-11 07:46:34,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970811828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:46:34,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:46:34,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:46:34,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509378796] [2024-10-11 07:46:34,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:46:34,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:46:34,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:46:34,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:46:34,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:46:34,876 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:46:35,445 INFO L93 Difference]: Finished difference Result 145 states and 217 transitions. [2024-10-11 07:46:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:46:35,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2024-10-11 07:46:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:46:35,451 INFO L225 Difference]: With dead ends: 145 [2024-10-11 07:46:35,452 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 07:46:35,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:46:35,453 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 07:46:35,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 07:46:35,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 07:46:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-10-11 07:46:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 07:46:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2024-10-11 07:46:35,475 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 112 [2024-10-11 07:46:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:46:35,475 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2024-10-11 07:46:35,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2024-10-11 07:46:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 07:46:35,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:35,477 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:35,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 07:46:35,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:46:35,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:35,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash 242284058, now seen corresponding path program 1 times [2024-10-11 07:46:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:46:35,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958321746] [2024-10-11 07:46:35,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:35,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:46:35,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:46:35,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:46:35,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:46:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:35,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 07:46:35,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:46:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-10-11 07:46:36,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:46:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 07:46:36,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:46:36,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958321746] [2024-10-11 07:46:36,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958321746] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:46:36,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:46:36,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-11 07:46:36,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862251419] [2024-10-11 07:46:36,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:46:36,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:46:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:46:36,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:46:36,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:46:36,305 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 07:46:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:46:37,515 INFO L93 Difference]: Finished difference Result 167 states and 243 transitions. [2024-10-11 07:46:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:46:37,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 112 [2024-10-11 07:46:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:46:37,517 INFO L225 Difference]: With dead ends: 167 [2024-10-11 07:46:37,517 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 07:46:37,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-11 07:46:37,518 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 63 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:46:37,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 131 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 07:46:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 07:46:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2024-10-11 07:46:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 66 states have internal predecessors, (79), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 07:46:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 163 transitions. [2024-10-11 07:46:37,536 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 163 transitions. Word has length 112 [2024-10-11 07:46:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:46:37,537 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 163 transitions. [2024-10-11 07:46:37,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 07:46:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 163 transitions. [2024-10-11 07:46:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 07:46:37,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:37,539 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:37,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 07:46:37,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:46:37,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:37,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1031490062, now seen corresponding path program 1 times [2024-10-11 07:46:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:46:37,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994054642] [2024-10-11 07:46:37,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:37,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:46:37,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:46:37,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:46:37,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 07:46:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:37,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 07:46:37,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:46:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 07:46:37,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:46:37,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:46:37,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994054642] [2024-10-11 07:46:37,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994054642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:46:37,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:46:37,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:46:37,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063558414] [2024-10-11 07:46:37,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:46:37,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:46:37,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:46:37,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:46:37,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:46:37,992 INFO L87 Difference]: Start difference. First operand 112 states and 163 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:46:38,911 INFO L93 Difference]: Finished difference Result 275 states and 382 transitions. [2024-10-11 07:46:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 07:46:38,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-10-11 07:46:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:46:38,913 INFO L225 Difference]: With dead ends: 275 [2024-10-11 07:46:38,913 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 07:46:38,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-10-11 07:46:38,915 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 88 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:46:38,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 219 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 07:46:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 07:46:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 90. [2024-10-11 07:46:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:46:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2024-10-11 07:46:38,929 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 113 [2024-10-11 07:46:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:46:38,929 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2024-10-11 07:46:38,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 07:46:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2024-10-11 07:46:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 07:46:38,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:46:38,931 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:46:38,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 07:46:39,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:46:39,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:46:39,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:46:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1031430480, now seen corresponding path program 1 times [2024-10-11 07:46:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:46:39,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290321441] [2024-10-11 07:46:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:46:39,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:46:39,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:46:39,140 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:46:39,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 07:46:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:46:39,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 07:46:39,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:47:05,083 WARN L286 SmtUtils]: Spent 7.81s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 07:47:27,738 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 07:47:58,276 WARN L286 SmtUtils]: Spent 11.87s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)