./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_codestructure_dependencies_file-19.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_codestructure_dependencies_file-19.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 97e3c609f4b6c1bd378cfd8687bfda55bf0f695228ff7bf21eaf0c1ebda97569 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:05:40,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:05:40,953 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:05:40,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:05:40,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:05:40,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:05:40,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:05:40,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:05:40,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:05:40,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:05:40,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:05:40,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:05:40,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:05:40,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:05:40,986 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:05:40,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:05:40,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:05:40,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:05:40,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:05:40,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:05:40,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:05:40,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:05:40,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:05:40,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:05:40,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:05:40,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:05:40,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:05:40,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:05:40,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:05:40,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:05:40,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:05:40,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:05:40,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:05:40,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:05:40,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:05:40,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:05:40,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:05:40,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:05:40,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:05:40,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:05:40,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:05:40,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:05:40,999 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 -> 97e3c609f4b6c1bd378cfd8687bfda55bf0f695228ff7bf21eaf0c1ebda97569 [2024-10-11 07:05:41,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:05:41,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:05:41,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:05:41,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:05:41,344 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:05:41,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-19.i [2024-10-11 07:05:42,781 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:05:43,033 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:05:43,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-19.i [2024-10-11 07:05:43,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bca757836/8312a43907c746da90ca92394bcb38a6/FLAG85736109c [2024-10-11 07:05:43,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bca757836/8312a43907c746da90ca92394bcb38a6 [2024-10-11 07:05:43,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:05:43,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:05:43,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:05:43,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:05:43,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:05:43,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560917f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43, skipping insertion in model container [2024-10-11 07:05:43,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:05:43,279 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_codestructure_dependencies_file-19.i[919,932] [2024-10-11 07:05:43,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:05:43,369 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:05:43,383 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_codestructure_dependencies_file-19.i[919,932] [2024-10-11 07:05:43,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:05:43,453 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:05:43,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43 WrapperNode [2024-10-11 07:05:43,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:05:43,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:05:43,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:05:43,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:05:43,463 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:05:43" (1/1) ... [2024-10-11 07:05:43,475 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:05:43" (1/1) ... [2024-10-11 07:05:43,533 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-10-11 07:05:43,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:05:43,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:05:43,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:05:43,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:05:43,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,576 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:05:43,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,605 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:05:43,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:05:43,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:05:43,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:05:43,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43" (1/1) ... [2024-10-11 07:05:43,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:05:43,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:05:43,667 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:05:43,670 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:05:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:05:43,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:05:43,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:05:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:05:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:05:43,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:05:43,823 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:05:43,826 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:05:44,165 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:05:44,166 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:05:44,209 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:05:44,209 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:05:44,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:05:44 BoogieIcfgContainer [2024-10-11 07:05:44,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:05:44,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:05:44,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:05:44,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:05:44,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:05:43" (1/3) ... [2024-10-11 07:05:44,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0a9d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:05:44, skipping insertion in model container [2024-10-11 07:05:44,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:43" (2/3) ... [2024-10-11 07:05:44,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0a9d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:05:44, skipping insertion in model container [2024-10-11 07:05:44,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:05:44" (3/3) ... [2024-10-11 07:05:44,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-19.i [2024-10-11 07:05:44,232 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:05:44,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:05:44,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:05:44,296 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;@4870f5b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:05:44,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:05:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:05:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 07:05:44,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:05:44,310 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:44,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:05:44,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:05:44,314 INFO L85 PathProgramCache]: Analyzing trace with hash 779004627, now seen corresponding path program 1 times [2024-10-11 07:05:44,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:05:44,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957880991] [2024-10-11 07:05:44,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:05:44,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:05:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:05:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:05:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:05:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:05:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:05:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:05:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:05:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:05:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:05:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:05:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:05:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:05:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:05:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:05:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:05:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:05:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:05:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:05:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:05:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:05:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:05:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:05:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:05:44,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:05:44,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957880991] [2024-10-11 07:05:44,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957880991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:05:44,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:05:44,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:05:44,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583811467] [2024-10-11 07:05:44,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:05:44,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:05:44,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:05:44,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:05:44,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:05:44,786 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:05:44,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:05:44,830 INFO L93 Difference]: Finished difference Result 111 states and 200 transitions. [2024-10-11 07:05:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:05:44,832 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2024-10-11 07:05:44,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:05:44,844 INFO L225 Difference]: With dead ends: 111 [2024-10-11 07:05:44,844 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 07:05:44,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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:05:44,852 INFO L432 NwaCegarLoop]: 82 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, 82 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:05:44,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:05:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 07:05:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 07:05:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:05:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2024-10-11 07:05:44,908 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 85 transitions. Word has length 136 [2024-10-11 07:05:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:05:44,909 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-10-11 07:05:44,910 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:05:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 85 transitions. [2024-10-11 07:05:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 07:05:44,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:05:44,914 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:44,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:05:44,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:05:44,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:05:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2143754981, now seen corresponding path program 1 times [2024-10-11 07:05:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:05:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758079583] [2024-10-11 07:05:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:05:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:05:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:05:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:05:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:05:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:05:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:05:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:05:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:05:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:05:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:05:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:05:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:05:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:05:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:05:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:05:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:05:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:05:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:05:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:05:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:05:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:05:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:05:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:05:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:05:45,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:05:45,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758079583] [2024-10-11 07:05:45,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758079583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:05:45,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:05:45,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:05:45,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810118985] [2024-10-11 07:05:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:05:45,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:05:45,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:05:45,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:05:45,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:05:45,569 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:05:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:05:45,756 INFO L93 Difference]: Finished difference Result 172 states and 265 transitions. [2024-10-11 07:05:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:05:45,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-10-11 07:05:45,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:05:45,762 INFO L225 Difference]: With dead ends: 172 [2024-10-11 07:05:45,763 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 07:05:45,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:05:45,766 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 62 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:05:45,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 248 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:05:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 07:05:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2024-10-11 07:05:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 07:05:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 166 transitions. [2024-10-11 07:05:45,802 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 166 transitions. Word has length 136 [2024-10-11 07:05:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:05:45,805 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 166 transitions. [2024-10-11 07:05:45,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:05:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 166 transitions. [2024-10-11 07:05:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 07:05:45,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:05:45,809 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:45,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:05:45,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:05:45,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:05:45,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1442690403, now seen corresponding path program 1 times [2024-10-11 07:05:45,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:05:45,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017797914] [2024-10-11 07:05:45,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:05:45,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:05:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:05:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:05:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:05:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:05:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:05:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:05:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:05:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:05:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:05:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:05:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:05:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:05:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:05:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:05:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:05:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:05:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:05:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:05:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:05:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:05:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:05:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:05:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:05:46,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:05:46,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017797914] [2024-10-11 07:05:46,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017797914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:05:46,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:05:46,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:05:46,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164373220] [2024-10-11 07:05:46,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:05:46,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:05:46,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:05:46,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:05:46,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:05:46,183 INFO L87 Difference]: Start difference. First operand 107 states and 166 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:05:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:05:46,248 INFO L93 Difference]: Finished difference Result 267 states and 415 transitions. [2024-10-11 07:05:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:05:46,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-10-11 07:05:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:05:46,255 INFO L225 Difference]: With dead ends: 267 [2024-10-11 07:05:46,255 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 07:05:46,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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:05:46,258 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 44 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:05:46,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 157 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:05:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 07:05:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-10-11 07:05:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 07:05:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 245 transitions. [2024-10-11 07:05:46,293 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 245 transitions. Word has length 136 [2024-10-11 07:05:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:05:46,294 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 245 transitions. [2024-10-11 07:05:46,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:05:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 245 transitions. [2024-10-11 07:05:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 07:05:46,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:05:46,296 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:46,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:05:46,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:05:46,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:05:46,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1835717413, now seen corresponding path program 1 times [2024-10-11 07:05:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:05:46,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780919560] [2024-10-11 07:05:46,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:05:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:05:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:05:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:05:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:05:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:05:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:05:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:05:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:05:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:05:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:05:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:05:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:05:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:05:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:05:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:05:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:05:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:05:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:05:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:05:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:05:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:46,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:05:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:47,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:05:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:05:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-11 07:05:47,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:05:47,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780919560] [2024-10-11 07:05:47,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780919560] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:05:47,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698498621] [2024-10-11 07:05:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:05:47,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:05:47,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:05:47,013 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:05:47,014 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:05:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:05:47,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 07:05:47,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:05:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 483 proven. 30 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-10-11 07:05:47,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:05:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-11 07:05:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698498621] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:05:47,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:05:47,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-11 07:05:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995417131] [2024-10-11 07:05:47,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:05:47,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:05:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:05:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:05:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:05:47,592 INFO L87 Difference]: Start difference. First operand 159 states and 245 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 07:05:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:05:47,902 INFO L93 Difference]: Finished difference Result 289 states and 431 transitions. [2024-10-11 07:05:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:05:47,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 136 [2024-10-11 07:05:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:05:47,906 INFO L225 Difference]: With dead ends: 289 [2024-10-11 07:05:47,906 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 07:05:47,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 311 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-11 07:05:47,908 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 123 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:05:47,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 120 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:05:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 07:05:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 171. [2024-10-11 07:05:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 98 states have internal predecessors, (120), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 07:05:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 252 transitions. [2024-10-11 07:05:47,963 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 252 transitions. Word has length 136 [2024-10-11 07:05:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:05:47,965 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 252 transitions. [2024-10-11 07:05:47,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 07:05:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 252 transitions. [2024-10-11 07:05:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 07:05:47,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:05:47,971 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:47,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:05:48,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:05:48,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:05:48,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:05:48,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1833870371, now seen corresponding path program 1 times [2024-10-11 07:05:48,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:05:48,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136240929] [2024-10-11 07:05:48,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:05:48,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:05:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:05:48,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:05:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:05:48,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:05:48,352 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:05:48,353 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:05:48,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:05:48,357 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 07:05:48,462 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:05:48,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:05:48 BoogieIcfgContainer [2024-10-11 07:05:48,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:05:48,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:05:48,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:05:48,467 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:05:48,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:05:44" (3/4) ... [2024-10-11 07:05:48,469 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:05:48,470 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:05:48,471 INFO L158 Benchmark]: Toolchain (without parser) took 5406.48ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 129.1MB in the beginning and 108.4MB in the end (delta: 20.7MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2024-10-11 07:05:48,471 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:05:48,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.72ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 111.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 07:05:48,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.91ms. Allocated memory is still 161.5MB. Free memory was 111.3MB in the beginning and 106.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 07:05:48,474 INFO L158 Benchmark]: Boogie Preprocessor took 95.84ms. Allocated memory is still 161.5MB. Free memory was 106.0MB in the beginning and 94.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 07:05:48,474 INFO L158 Benchmark]: RCFGBuilder took 578.00ms. Allocated memory is still 161.5MB. Free memory was 94.5MB in the beginning and 107.7MB in the end (delta: -13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 07:05:48,474 INFO L158 Benchmark]: TraceAbstraction took 4254.28ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 107.7MB in the beginning and 108.4MB in the end (delta: -734.8kB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-10-11 07:05:48,474 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 199.2MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:05:48,476 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.15ms. Allocated memory is still 104.9MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.72ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 111.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.91ms. Allocated memory is still 161.5MB. Free memory was 111.3MB in the beginning and 106.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.84ms. Allocated memory is still 161.5MB. Free memory was 106.0MB in the beginning and 94.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 578.00ms. Allocated memory is still 161.5MB. Free memory was 94.5MB in the beginning and 107.7MB in the end (delta: -13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4254.28ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 107.7MB in the beginning and 108.4MB in the end (delta: -734.8kB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 199.2MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someUnaryFLOAToperation at line 53, overapproximation of someBinaryArithmeticFLOAToperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] signed short int var_1_6 = -16; [L26] unsigned short int var_1_7 = 56838; [L27] unsigned short int var_1_8 = 24612; [L28] signed short int var_1_9 = 20013; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 0; [L32] signed short int var_1_14 = 50; [L33] unsigned char var_1_15 = 0; [L34] signed short int var_1_19 = 100; [L35] double var_1_21 = 3.5; [L36] signed short int var_1_23 = -128; [L37] float var_1_24 = 10.2; [L38] float var_1_25 = 8.6; [L39] float var_1_26 = 32.7; [L40] float var_1_27 = 16.25; [L41] float var_1_28 = 8.875; [L42] unsigned short int var_1_29 = 256; [L43] unsigned char last_1_var_1_15 = 0; [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L120] last_1_var_1_15 = var_1_15 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L84] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L85] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L85] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L86] var_1_3 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L88] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L88] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L89] var_1_7 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L90] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L91] CALL assume_abort_if_not(var_1_7 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L91] RET assume_abort_if_not(var_1_7 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=24612, var_1_9=20013] [L92] var_1_8 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L93] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L94] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L94] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=20013] [L95] var_1_9 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_9 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L96] RET assume_abort_if_not(var_1_9 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L97] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L97] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L98] var_1_12 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L99] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L100] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L100] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L101] var_1_13 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L102] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L103] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L103] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L104] var_1_21 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L105] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L106] CALL assume_abort_if_not(var_1_21 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L106] RET assume_abort_if_not(var_1_21 != 0.0F) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L107] var_1_23 = __VERIFIER_nondet_short() [L108] CALL assume_abort_if_not(var_1_23 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L108] RET assume_abort_if_not(var_1_23 >= -16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L109] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L109] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L110] var_1_25 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L111] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L112] var_1_26 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L113] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L114] var_1_27 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L115] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L116] var_1_28 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L117] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L131] RET updateVariables() [L132] CALL step() [L47] COND FALSE !(\read(last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L50] COND FALSE !(\read(var_1_10)) [L53] var_1_24 = ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L55] COND FALSE !(var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) [L62] var_1_19 = var_1_2 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L64] COND FALSE !(var_1_24 != var_1_24) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L67] COND TRUE (- var_1_24) == (var_1_24 + var_1_24) [L68] var_1_15 = var_1_12 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L70] COND TRUE (var_1_7 - (var_1_8 - var_1_2)) >= var_1_29 [L71] var_1_6 = (var_1_3 - (var_1_9 - var_1_2)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16129, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L73] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16129, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L76] COND TRUE (var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6))) [L77] var_1_1 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=127, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16129, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L132] RET step() [L133] CALL, EXPR property() [L123-L124] return (((((((((var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6)))) ? (var_1_1 == ((signed long int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : (var_1_1 == ((signed long int) var_1_2))) && (((var_1_7 - (var_1_8 - var_1_2)) >= var_1_29) ? (var_1_6 == ((signed short int) (var_1_3 - (var_1_9 - var_1_2)))) : 1)) && (last_1_var_1_15 ? (var_1_10 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && (var_1_15 ? (var_1_14 == ((signed short int) (((((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) < (var_1_9)) ? ((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) : (var_1_9))))) : 1)) && (((- var_1_24) == (var_1_24 + var_1_24)) ? (var_1_15 == ((unsigned char) var_1_12)) : 1)) && ((var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) ? (var_1_10 ? (var_1_19 == ((signed short int) (var_1_3 + ((((var_1_2) < (var_1_23)) ? (var_1_2) : (var_1_23)))))) : (var_1_19 == ((signed short int) (var_1_3 - 8)))) : (var_1_19 == ((signed short int) var_1_2)))) && (var_1_10 ? (var_1_24 == ((float) ((((var_1_25) > (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))) ? (var_1_25) : (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))))) : (var_1_24 == ((float) ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))))))) && ((var_1_24 != var_1_24) ? (var_1_29 == ((unsigned short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=127, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16129, var_1_7=32896, var_1_8=32767, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=127, var_1_24=56843, var_1_29=256, var_1_2=127, var_1_3=127, var_1_6=-16129, var_1_7=32896, var_1_8=32767, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 607 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 306 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 472 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 25 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 816 NumberOfCodeBlocks, 816 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 810 ConstructedInterpolants, 0 QuantifiedInterpolants, 1734 SizeOfPredicates, 3 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 5454/5544 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:05:48,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_codestructure_dependencies_file-19.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 97e3c609f4b6c1bd378cfd8687bfda55bf0f695228ff7bf21eaf0c1ebda97569 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:05:50,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:05:50,785 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:05:50,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:05:50,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:05:50,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:05:50,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:05:50,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:05:50,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:05:50,832 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:05:50,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:05:50,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:05:50,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:05:50,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:05:50,835 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:05:50,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:05:50,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:05:50,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:05:50,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:05:50,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:05:50,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:05:50,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:05:50,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:05:50,841 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:05:50,842 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:05:50,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:05:50,843 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:05:50,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:05:50,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:05:50,844 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:05:50,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:05:50,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:05:50,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:05:50,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:05:50,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:05:50,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:05:50,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:05:50,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:05:50,848 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:05:50,848 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:05:50,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:05:50,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:05:50,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:05:50,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:05:50,849 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:05:50,850 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 -> 97e3c609f4b6c1bd378cfd8687bfda55bf0f695228ff7bf21eaf0c1ebda97569 [2024-10-11 07:05:51,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:05:51,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:05:51,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:05:51,222 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:05:51,223 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:05:51,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-19.i [2024-10-11 07:05:52,799 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:05:53,036 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:05:53,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-19.i [2024-10-11 07:05:53,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a02b201a6/15d90e2d40d4431086f05423e13b2560/FLAG82ff714d8 [2024-10-11 07:05:53,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a02b201a6/15d90e2d40d4431086f05423e13b2560 [2024-10-11 07:05:53,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:05:53,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:05:53,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:05:53,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:05:53,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:05:53,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dcedf85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53, skipping insertion in model container [2024-10-11 07:05:53,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:05:53,295 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_codestructure_dependencies_file-19.i[919,932] [2024-10-11 07:05:53,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:05:53,400 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:05:53,412 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_codestructure_dependencies_file-19.i[919,932] [2024-10-11 07:05:53,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:05:53,477 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:05:53,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53 WrapperNode [2024-10-11 07:05:53,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:05:53,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:05:53,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:05:53,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:05:53,486 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:05:53" (1/1) ... [2024-10-11 07:05:53,504 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:05:53" (1/1) ... [2024-10-11 07:05:53,546 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-10-11 07:05:53,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:05:53,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:05:53,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:05:53,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:05:53,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,589 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:05:53,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:05:53,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:05:53,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:05:53,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:05:53,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53" (1/1) ... [2024-10-11 07:05:53,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:05:53,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:05:53,663 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:05:53,667 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:05:53,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:05:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:05:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:05:53,708 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:05:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:05:53,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:05:53,796 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:05:53,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:06:07,028 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:06:07,029 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:06:07,078 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:06:07,078 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:06:07,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:06:07 BoogieIcfgContainer [2024-10-11 07:06:07,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:06:07,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:06:07,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:06:07,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:06:07,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:05:53" (1/3) ... [2024-10-11 07:06:07,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f4d8c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:06:07, skipping insertion in model container [2024-10-11 07:06:07,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:53" (2/3) ... [2024-10-11 07:06:07,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f4d8c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:06:07, skipping insertion in model container [2024-10-11 07:06:07,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:06:07" (3/3) ... [2024-10-11 07:06:07,095 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-19.i [2024-10-11 07:06:07,112 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:06:07,113 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:06:07,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:06:07,190 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;@1a029f5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:06:07,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:06:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:06:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 07:06:07,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:06:07,207 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:07,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:06:07,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:06:07,214 INFO L85 PathProgramCache]: Analyzing trace with hash 779004627, now seen corresponding path program 1 times [2024-10-11 07:06:07,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:06:07,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134380098] [2024-10-11 07:06:07,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:06:07,228 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:06:07,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:06:07,231 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:06:07,232 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:06:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:06:08,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:06:08,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:06:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-11 07:06:08,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:06:08,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:06:08,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134380098] [2024-10-11 07:06:08,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134380098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:06:08,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:06:08,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:06:08,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231152557] [2024-10-11 07:06:08,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:06:08,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:06:08,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:06:08,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:06:08,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:06:08,200 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:06:12,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:06:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:06:12,666 INFO L93 Difference]: Finished difference Result 111 states and 200 transitions. [2024-10-11 07:06:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:06:12,817 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2024-10-11 07:06:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:06:12,823 INFO L225 Difference]: With dead ends: 111 [2024-10-11 07:06:12,823 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 07:06:12,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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:06:12,829 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 07:06:12,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 07:06:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 07:06:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 07:06:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 07:06:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2024-10-11 07:06:12,871 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 85 transitions. Word has length 136 [2024-10-11 07:06:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:06:12,871 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 85 transitions. [2024-10-11 07:06:12,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 07:06:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 85 transitions. [2024-10-11 07:06:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 07:06:12,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:06:12,875 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:12,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 07:06:13,076 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:06:13,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:06:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:06:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2143754981, now seen corresponding path program 1 times [2024-10-11 07:06:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:06:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082755909] [2024-10-11 07:06:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:06:13,079 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:06:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:06:13,081 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:06:13,083 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:06:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:06:13,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 07:06:13,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:06:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:06:19,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:06:19,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:06:19,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082755909] [2024-10-11 07:06:19,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082755909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:06:19,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:06:19,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:06:19,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238910938] [2024-10-11 07:06:19,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:06:19,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:06:19,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:06:19,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:06:19,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:06:19,088 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:06:23,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:06:27,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:06:31,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:06:36,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:06:40,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:06:44,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:06:48,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:06:52,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:06:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:06:52,637 INFO L93 Difference]: Finished difference Result 184 states and 283 transitions. [2024-10-11 07:06:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:06:52,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-10-11 07:06:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:06:52,793 INFO L225 Difference]: With dead ends: 184 [2024-10-11 07:06:52,793 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 07:06:52,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:06:52,795 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 76 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 49 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.4s IncrementalHoareTripleChecker+Time [2024-10-11 07:06:52,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 263 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 33.4s Time] [2024-10-11 07:06:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 07:06:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2024-10-11 07:06:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 07:06:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 166 transitions. [2024-10-11 07:06:52,832 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 166 transitions. Word has length 136 [2024-10-11 07:06:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:06:52,833 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 166 transitions. [2024-10-11 07:06:52,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:06:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 166 transitions. [2024-10-11 07:06:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 07:06:52,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:06:52,838 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:52,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 07:06:53,038 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:06:53,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:06:53,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:06:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1442690403, now seen corresponding path program 1 times [2024-10-11 07:06:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:06:53,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619322206] [2024-10-11 07:06:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:06:53,041 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:06:53,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:06:53,043 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:06:53,046 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:06:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:06:53,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:06:53,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:06:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 07:06:58,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:06:58,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:06:58,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619322206] [2024-10-11 07:06:58,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619322206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:06:58,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:06:58,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:06:58,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306645311] [2024-10-11 07:06:58,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:06:58,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:06:58,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:06:58,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:06:58,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:06:58,455 INFO L87 Difference]: Start difference. First operand 107 states and 166 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:07:02,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:07:07,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:07:11,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:07:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:07:11,728 INFO L93 Difference]: Finished difference Result 319 states and 496 transitions. [2024-10-11 07:07:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:07:11,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-10-11 07:07:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:07:11,732 INFO L225 Difference]: With dead ends: 319 [2024-10-11 07:07:11,732 INFO L226 Difference]: Without dead ends: 213 [2024-10-11 07:07:11,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:07:11,740 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 19 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:07:11,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 157 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 3 Unknown, 0 Unchecked, 13.2s Time] [2024-10-11 07:07:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-11 07:07:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-10-11 07:07:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 118 states have (on average 1.271186440677966) internal successors, (150), 118 states have internal predecessors, (150), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 07:07:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 326 transitions. [2024-10-11 07:07:11,779 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 326 transitions. Word has length 136 [2024-10-11 07:07:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:07:11,780 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 326 transitions. [2024-10-11 07:07:11,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 07:07:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 326 transitions. [2024-10-11 07:07:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 07:07:11,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:07:11,785 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:11,813 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:07:11,986 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:07:11,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:07:11,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:07:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1835717413, now seen corresponding path program 1 times [2024-10-11 07:07:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:07:11,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937348834] [2024-10-11 07:07:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:07:11,988 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:07:11,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:07:11,991 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:07:11,992 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:07:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:07:12,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 07:07:12,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:07:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 483 proven. 30 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-10-11 07:07:15,781 INFO L311 TraceCheckSpWp]: Computing backward predicates...